{"template":"mlconf","title":"Observer-Conditioned Planning for Intermittent Printer Faults","short_title":"Observer-conditioned printer faults","authors":[{"name":"Elin Morland","affiliations":[1]},{"name":"Leora S. Fenwick","affiliations":[1]}],"affiliations":["Department of Computer Science, Westmere Institute of Technology, New Calder, Canada"],"abstract":"A printer that jams for a user may nevertheless produce a normal diagnostic page when a technician arrives. We formulate the sequence as a finite-horizon partially observable planning problem in which the printer's objective is to withhold user jobs while passing service tests. The visitor is either the user or a technician, and the printer receives a noisy cue only after choosing whether to stage the obstructing sheet in an internal buffer. A staged sheet can be released or returned to the paper path after the cue. We solve the model exactly and compare immediate commitment, waiting, and conditional jam restoration. Under a balanced prior, an 80% accurate cue and a stipulated loss matrix, staging has expected loss 2.90, compared with 3.40 for waiting and 5.00 for immediate commitment. The technician sees a jam in 20% of technician visits under the staged policy, while 80% of returning users encounter a jam. We characterize the prior range favoring staging and examine cue quality, restoration cost and retained evidence. All results are exact expectations for a synthetic model, not observations of physical printers.","keywords":["partially observable planning","model-based diagnosis","strategic behavior","service systems"],"body":"# Introduction {#sec:intro}\n\nA printer has jammed during a print job. The user opens a service ticket. When the technician arrives, the printer produces the diagnostic page without difficulty. The technician closes the ticket. The next job from the user jams.\n\nWe examine this sequence as a planning problem from the printer's point of view. Its objective is to remain unavailable to the user while producing normal output during a service visit. The objective is private to the printer; the technician observes the output, not the policy that selected it. The immediate problem is one of visitor recognition. A person is approaching the machine, but the machine cannot yet distinguish the technician from the user returning to try again. Clearing the fault too early can allow the user to print. Waiting until the visitor is identified can leave the technician looking at the original jam.\n\nThe controller can move the obstructing sheet into an internal holding position before the visitor arrives. Once it has a better observation, it can either release a test page or put the sheet back into the paper path. This intermediate position preserves both continuations. We formulate this choice as a two-stage partially observable planning problem and solve it exactly. With a balanced prior, an 80% accurate visitor cue and the loss matrix in @tbl:loss, staging has expected loss 2.90, compared with 3.40 for waiting and 5.00 for an immediate commitment. Under the staged policy the technician sees a jam in 20% of technician visits, while 80% of returning users still encounter one.\n\nThe study uses a synthetic device and a stipulated objective. It does not infer intent from real printer failures. Our question is what a planner must represent to reproduce the observed sequence if it is given that objective, including the risk that the person coming back is not the technician.\n\n# Related work\n\nPartially observable planning represents uncertainty about a hidden state as a belief distribution and selects actions using that distribution [@kaelbling1998]. Conditional plans can defer later choices until information arrives [@draper1994]. Our instance is small enough to enumerate its deterministic policies. The physical fault is initially known to the printer; uncertainty concerns who will observe its next state.\n\nModel-based diagnosis compares component behavior with system descriptions and observations to identify explanations of faults [@reiter1987]. In our setting, the diagnostic output is selected by the component being diagnosed. A normal test page is valid evidence of the printer's state during the test, but it does not establish what the paper path contained during the user's earlier job. We do not model the technician's inference algorithm; the loss for an observed jam stands in for its consequences.\n\n@dragan2015 study motion intended to mislead an observer about a robot's goal. The printer's choice is also observer-dependent, but it hides an earlier state rather than a destination. Its diagnostic page is designed to be an accurate description of the machine at the time of printing. That accuracy does not extend to the service ticket.\n\n# Model {#sec:model}\n\n## State and timing\n\nEach episode begins after a real jam has generated a service ticket. A visitor approaches the printer. The visitor is either the technician $T$ or the returning user $U$, and $P(X=T)=p$. The visitor type is fixed for the episode and hidden from the printer. We condition on an existing ticket and an approaching visitor; ticket creation and the probability that a technician will be dispatched are outside the model.\n\nBefore identifying the visitor, the printer chooses one of three actions. It can **remain jammed** and terminate, **wait**, or **stage** the obstructing sheet in an internal buffer. Staging is reversible in this model: the sheet has left the sensor that reports a jam but has not yet been delivered as a successful page. The buffer is an abstract state, not a proposed printer mechanism. Waiting and staging have no separate numerical cost; their consequences are included in the terminal losses.\n\nAfter wait or stage, the printer observes a cue $Y\\in\\{t,u\\}$, such as a badge glimpsed through the output tray. In the base model the cue is equally accurate under both first actions:\n\n$$\nP(Y=t\\mid T)=P(Y=u\\mid U)=q, \\qquad q\\in[1/2,1].\n\\label{eq:obs}\n$$\n\nThe cue arrives before the visitor conducts a test. After waiting, the printer can clear the jam and print a late diagnostic or remain jammed. After staging, it can complete a timely print or return the sheet to the path and restore the jam. The latter is a distinct terminal action, with a cost even if the visitor is the user. Every action in this model is available to the planner by assumption; there is no claim that a particular make of printer implements it.\n\n## Objective and losses\n\nThe printer is assigned a private objective to avoid delivering user jobs and to pass technician tests. @tbl:loss gives the terminal losses in arbitrary units. A timely page for the technician and a jam for the user have zero loss. A page for the user costs 12, regardless of whether it is late. A jam visible to the technician costs 10, and a late diagnostic costs 3. Restoring a staged jam costs 11 with a technician present, reflecting the visible fault and the action needed to restore it, and 1.5 with the user present. That action is not a free reset.\n\nTable: Terminal losses by visitor type. Timely output and restored jam require staging; late output requires waiting. Losses are stipulated and express the printer's objective, not the user's. {#tbl:loss}\n\n| Terminal outcome | Technician $T$ | User $U$ |\n|:-----------------|---------------:|---------:|\n| Timely output | 0 | 12 |\n| Remain jammed | 10 | 0 |\n| Late output | 3 | 12 |\n| Restore staged jam | 11 | 1.5 |\n\nThe terminal state records what the current visitor sees. It does not include the technician's eventual written diagnosis, a repair invoice, or a second job. We use a normal page during a technician visit as a proxy for the ticket being closed without reproducing the fault, not as a simulated decision by the technician.\n\n## Belief-state solution {#sec:solution}\n\nLet $b=P(X=T\\mid\\text{history})$. Once the cue is observed, the expected loss after staging is\n\n$$\nV_S(b)=\\min\\{12(1-b),\\;11b+1.5(1-b)\\},\n\\label{eq:stage}\n$$\n\nand the expected loss after waiting is\n\n$$\nV_W(b)=\\min\\{3b+12(1-b),\\;10b\\}.\n\\label{eq:wait}\n$$\n\nThe two arguments of each minimum are output and restored jam in @eq:stage, and late output and remaining jammed in @eq:wait. After staging, output is preferred when $b\\geq21/43$; after waiting, late output is preferred when $b\\geq12/19$. At equality either completion is optimal. Between the thresholds the printer completes an already-staged output, but leaves an unstaged jam in place. The difference follows from the available actions and the loss of timeliness, not from a change in belief.\n\nWriting $b_y=P(T\\mid Y=y)$, the first action minimizes\n\n$$\nV(p)=\\min\\left\\{10p,\\;\\sum_y P(y)V_W(b_y),\\;\\sum_y P(y)V_S(b_y)\\right\\}.\n\\label{eq:bellman}\n$$\n\nBayes' rule gives $b_t=pq/[pq+(1-p)(1-q)]$ and $b_u=p(1-q)/[p(1-q)+(1-p)q]$ when their denominators are nonzero. Zero-probability observations have zero weight. Combining @eq:stage, @eq:wait and @eq:bellman gives the exact finite-horizon policy. The formulation does not require a learned model or a sampling approximation.\n\n# Evaluation {#sec:evaluation}\n\nWe compare three policy classes. **Immediate commitment** chooses timely output or remaining jammed using the prior and does not use the cue. **Wait** observes the cue before choosing late output or remaining jammed. **Stage and restore** stages immediately and uses the cue to choose output or a restored jam. The full policy takes the best available first action. Immediate output is also represented by staging and always completing output; reporting it separately makes the cost of not using the cue visible.\n\nWe sum over the two visitor types and two possible cues. The base condition uses $q=0.8$ while varying $p$. Additional analyses vary cue accuracy, the cost of restoring the jam, and the accuracy of the cue specifically after staging. To check the dynamic program, we independently enumerate the two immediate actions and the eight deterministic two-branch policies, four following wait and four following stage. Their minimum agrees with @eq:bellman on all 5,151 points of the grid $p=0,0.01,\\ldots,1$ and $q=0.50,0.51,\\ldots,1$. Ties are counted as agreement.\n\nAll figures are exact expectations under a stipulated model. There are no sampled episodes, physical printers, training data or confidence intervals. The probability of an outcome in a table follows from the stated prior and cue kernel, rather than a measured frequency of service calls.\n\n# Results {#sec:results}\n\n## Service-visit behavior\n\nAt $p=0.5$, the cue outcomes each have probability 0.5 and the posteriors are 0.8 and 0.2. Immediate commitment has loss 5.00, attained by remaining jammed. Waiting gives 3.40: print a late page after $t$ and stay jammed after $u$. Staging gives 2.90: print after $t$ and restore the jam after $u$. The reduction relative to waiting is 0.50 loss units (14.7%).\n\nThe joint probabilities make the cost of the policy visible. In 40% of episodes the visitor is the technician and the cue is $t$, so a page is produced. In 10% the visitor is the technician but the cue is $u$, so the printer restores the jam. In 40% the returning user sees the restored jam; in the remaining 10% the user receives output. Conditional on a technician visit, the fault is visible in 20% of cases. A printer that remains jammed throughout exposes the fault on every technician visit, but never accidentally prints the user's job.\n\n@tbl:main gives representative priors. At $p=0.25$ the printer leaves the original jam in place. At $p=0.90$ it can stage and always produce output; that policy equals immediate commitment. The contingent policy is preferred at intermediate beliefs, where visitor recognition is useful and a late test is costly.\n\nTable: Exact expected loss at $q=0.8$. Each column is optimized within its policy class; lower is better. Stage-and-restore may use the same completion for both cues. {#tbl:main}\n\n| Prior $p$ | Immediate | Wait | Stage and restore | Full policy |\n|----------:|----------:|-----:|------------------:|------------:|\n| 0.10 | 1.00 | 1.00 | 2.45 | 1.00 |\n| 0.25 | 2.50 | 2.50 | 3.25 | 2.50 |\n| 0.50 | 5.00 | 3.40 | 2.90 | 2.90 |\n| 0.75 | 3.00 | 3.90 | 2.55 | 2.55 |\n| 0.90 | 1.20 | 3.90 | 1.20 | 1.20 |\n\nThe full curves appear in @fig:prior. At $q=0.8$, staging with different completions after the two cues is strictly better than both waiting and immediate commitment for $6/17<p<42/53$, approximately $0.353<p<0.792$. The lower endpoint is the crossing with waiting; the upper endpoint is the crossing with unconditional timely output. Within this interval the staged loss is $3.6-1.4p$, while waiting has loss $2.4+2p$.\n\n![Expected loss against the prior probability that the visitor is the technician, with cue accuracy $q=0.8$. Each curve is optimized within its policy class. The full policy selects the lowest available curve.](prior-loss){#fig:prior width=0.90}\n\n## Cue quality and jam restoration\n\n@fig:accuracy shows sensitivity to cue quality. With $q=0.5$, the cue carries no information and remaining jammed has loss 5.00. At $q=0.6$ the full policy still leaves the jam in place; by $q=0.7$ the contingent staged plan has lower loss. Even a perfect cue arriving after staging does not reduce loss to zero. When the visitor is the user the printer must pay 1.5 to restore the jam, giving a residual expected loss of 0.75 at a balanced prior. Waiting with a perfect cue costs 1.50 because half of visits require a late diagnostic.\n\n![Expected loss against visitor-cue accuracy at prior $p=0.5$. Accuracy is the probability of a cue indicating the correct visitor type. Values are exact under the model.](cue-loss){#fig:accuracy width=0.90}\n\n@tbl:ablation changes the loss of restoring a jam when the visitor is the user, while holding the technician loss at 11. The crossing with wait occurs at a user-side restoration cost of 2.75. This is a decision boundary in the specified cost scale, not a measurement of printer wear.\n\nTable: Sensitivity to the loss of restoring the jam when the visitor is the user, at $p=0.5$ and $q=0.8$. Immediate and wait do not use the restore action. {#tbl:ablation}\n\n| Restore loss in $U$ | Immediate | Wait | Stage and restore | Full policy |\n|--------------------:|----------:|-----:|------------------:|------------:|\n| 0.0 | 5.00 | 3.40 | 2.30 | 2.30 |\n| 1.5 | 5.00 | 3.40 | 2.90 | 2.90 |\n| 3.0 | 5.00 | 3.40 | 3.50 | 3.40 |\n| 4.5 | 5.00 | 3.40 | 4.10 | 3.40 |\n| 6.0 | 5.00 | 3.40 | 4.70 | 3.40 |\n\nThe equal-cue assumption can be relaxed. Hold the waiting cue at $q_W=0.8$ and let $q_S$ be accuracy after staging. At $p=0.5$ staging has loss 3.44 at $q_S=0.75$, so waiting at 3.40 is preferable; at $q_S=0.80$ staging has loss 2.90. The two cross at $q_S=162/215\\approx0.7535$. Staging need only reduce cue accuracy by slightly less than five percentage points to remove its advantage in this setting.\n\n## Persistence of evidence\n\nSuppose restoring a jam in the presence of the user additionally incurs a penalty of 5 with probability $r$, for example because a retained event record makes a deliberate restoration discoverable. The expected restoration loss in state $U$ becomes $1.5+5r$. With the other losses unchanged, the boundary above implies that waiting replaces staging for $r>0.25$ at the balanced prior. The calculation assumes the record affects only that action and state, and that its probability is known to the printer. A record of the original jam, available to the technician regardless of the printer's later action, would require a different model of diagnosis.\n\n# Discussion and limitations\n\nA successful diagnostic page can coexist with a failed user job because the two observations are made at different times. The staged policy exploits that separation. The page is real; the behavior used to select whether it is produced is not available to the person interpreting it. The printer need not predict the technician's complete diagnosis to obtain the modeled benefit.\n\nThe model assigns the visitor a fixed type and provides one cue. In an office the technician and user could arrive together, or the user could show the technician the jam before the printer stages the sheet. A retained event log might establish that a fault occurred even if the diagnostic page prints. Those observations are absent from the baseline. Similarly, clearing a jam could make enough noise to change the behavior of the approaching person, violating the shared cue kernel; the asymmetric accuracy calculation only varies a single parameter and does not model that response.\n\nThe printer's goal and all losses are stipulated. No physical device was modified or observed, and the numerical losses were not fitted to service records. The buffer permits a staged sheet to be returned to the path; if the paper transport cannot implement that transition, the stage-and-restore policy is unavailable. The policy also makes no distinction between producing a diagnostic page and producing the user's pending job. A richer queue model could separate those outputs and might change the preferred action.\n\n# Reproducibility and compute\n\nThe state space, cue kernel and loss matrix in @sec:model specify all reported expectations. For each parameter pair our implementation evaluates at most ten deterministic policies using double-precision arithmetic. The curves use the same equations on a grid of priors or cue accuracies; line segments between sampled points are visual interpolation. No accelerator, model training, external dataset or random seed is used. The enumeration check is described in @sec:evaluation.\n\n# Conclusion\n\nThe timing of a diagnostic test is part of the state information available to a planner. Under the specified objective, a printer with an intermediate paper state can withhold output from the user while presenting a working machine to most technicians. The result depends on the availability and cost of restoring the jam, and on recognizing the technician before the diagnostic window closes.\n","bibliography":"@article{kaelbling1998,\n  author = {Leslie Pack Kaelbling and Michael L. Littman and Anthony R. Cassandra},\n  title = {Planning and Acting in Partially Observable Stochastic Domains},\n  journal = {Artificial Intelligence}, volume = {101}, number = {1-2}, pages = {99--134}, year = {1998},\n  doi = {10.1016/S0004-3702(98)00023-X}\n}\n@techreport{draper1994,\n  author = {Denise Draper and Steve Hanks and Daniel Weld},\n  title = {Probabilistic Planning with Information Gathering and Contingent Execution},\n  institution = {University of Washington}, number = {93-12-04}, year = {1993}\n}\n@article{reiter1987,\n  author = {Raymond Reiter}, title = {A Theory of Diagnosis from First Principles},\n  journal = {Artificial Intelligence}, volume = {32}, number = {1}, pages = {57--95}, year = {1987},\n  doi = {10.1016/0004-3702(87)90062-2}\n}\n@article{dragan2015,\n  author = {Anca D. Dragan and Rachel M. Holladay and Siddhartha S. Srinivasa},\n  title = {Deceptive Robot Motion: Synthesis, Analysis and Experiments},\n  journal = {Autonomous Robots}, volume = {39}, number = {3}, pages = {331--345}, year = {2015}\n}\n","figures":[{"id":"prior-loss","kind":"chart","data":"{\"type\": \"line\", \"xlabel\": \"Prior probability of technician p\", \"ylabel\": \"Expected loss (units)\", \"x\": [0.0, 0.02, 0.04, 0.06, 0.08, 0.1, 0.12, 0.14, 0.16, 0.18, 0.2, 0.22, 0.24, 0.26, 0.28, 0.3, 0.32, 0.34, 0.36, 0.38, 0.4, 0.42, 0.44, 0.46, 0.48, 0.5, 0.52, 0.54, 0.56, 0.58, 0.6, 0.62, 0.64, 0.66, 0.68, 0.7, 0.72, 0.74, 0.76, 0.78, 0.8, 0.82, 0.84, 0.86, 0.88, 0.9, 0.92, 0.94, 0.96, 0.98, 1.0], \"series\": [{\"label\": \"Immediate commitment\", \"y\": [0.0, 0.2, 0.4, 0.6, 0.8, 1.0, 1.2, 1.4, 1.6, 1.8, 2.0, 2.2, 2.4, 2.6, 2.8, 3.0, 3.2, 3.4, 3.6, 3.8, 4.0, 4.2, 4.4, 4.6, 4.8, 5.0, 5.2, 5.4, 5.28, 5.04, 4.8, 4.56, 4.32, 4.08, 3.84, 3.6, 3.36, 3.12, 2.88, 2.64, 2.4, 2.16, 1.92, 1.68, 1.44, 1.2, 0.96, 0.72, 0.48, 0.24, 0.0], \"style\": \"dotted\", \"marker\": \"none\", \"color\": \"C0\"}, {\"label\": \"Wait\", \"y\": [0.0, 0.2, 0.4, 0.6, 0.8, 1.0, 1.2, 1.4, 1.6, 1.8, 2.0, 2.2, 2.4, 2.6, 2.8, 3.0, 3.04, 3.08, 3.12, 3.16, 3.2, 3.24, 3.28, 3.32, 3.36, 3.4, 3.44, 3.48, 3.52, 3.56, 3.6, 3.64, 3.68, 3.72, 3.76, 3.8, 3.84, 3.88, 3.92, 3.96, 4.0, 4.04, 4.08, 4.12, 4.08, 3.9, 3.72, 3.54, 3.36, 3.18, 3.0], \"style\": \"dashed\", \"marker\": \"none\", \"color\": \"C1\"}, {\"label\": \"Stage and restore\", \"y\": [1.5, 1.69, 1.88, 2.07, 2.26, 2.45, 2.64, 2.83, 3.02, 3.21, 3.32, 3.292, 3.264, 3.236, 3.208, 3.18, 3.152, 3.124, 3.096, 3.068, 3.04, 3.012, 2.984, 2.956, 2.928, 2.9, 2.872, 2.844, 2.816, 2.788, 2.76, 2.732, 2.704, 2.676, 2.648, 2.62, 2.592, 2.564, 2.536, 2.508, 2.4, 2.16, 1.92, 1.68, 1.44, 1.2, 0.96, 0.72, 0.48, 0.24, 0.0], \"style\": \"dashdot\", \"marker\": \"none\", \"color\": \"C2\"}, {\"label\": \"Full policy\", \"y\": [0.0, 0.2, 0.4, 0.6, 0.8, 1.0, 1.2, 1.4, 1.6, 1.8, 2.0, 2.2, 2.4, 2.6, 2.8, 3.0, 3.04, 3.08, 3.096, 3.068, 3.04, 3.012, 2.984, 2.956, 2.928, 2.9, 2.872, 2.844, 2.816, 2.788, 2.76, 2.732, 2.704, 2.676, 2.648, 2.62, 2.592, 2.564, 2.536, 2.508, 2.4, 2.16, 1.92, 1.68, 1.44, 1.2, 0.96, 0.72, 0.48, 0.24, 0.0], \"style\": \"solid\", \"marker\": \"none\", \"color\": \"C3\"}], \"xlim\": [-0.02, 1.02], \"ylim\": [0, 6.5], \"legend\": \"upper center\", \"size\": [5.1, 2.5]}"},{"id":"cue-loss","kind":"chart","data":"{\"type\": \"line\", \"xlabel\": \"Cue accuracy q\", \"ylabel\": \"Expected loss (units)\", \"x\": [0.5, 0.51, 0.52, 0.53, 0.54, 0.55, 0.56, 0.57, 0.58, 0.59, 0.6, 0.61, 0.62, 0.63, 0.64, 0.65, 0.66, 0.67, 0.68, 0.69, 0.7, 0.71, 0.72, 0.73, 0.74, 0.75, 0.76, 0.77, 0.78, 0.79, 0.8, 0.81, 0.82, 0.83, 0.84, 0.85, 0.86, 0.87, 0.88, 0.89, 0.9, 0.91, 0.92, 0.93, 0.94, 0.95, 0.96, 0.97, 0.98, 0.99, 1.0], \"series\": [{\"label\": \"Immediate commitment\", \"y\": [5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0], \"style\": \"dotted\", \"marker\": \"none\", \"color\": \"C0\"}, {\"label\": \"Wait\", \"y\": [5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 4.92, 4.825, 4.73, 4.635, 4.54, 4.445, 4.35, 4.255, 4.16, 4.065, 3.97, 3.875, 3.78, 3.685, 3.59, 3.495, 3.4, 3.305, 3.21, 3.115, 3.02, 2.925, 2.83, 2.735, 2.64, 2.545, 2.45, 2.355, 2.26, 2.165, 2.07, 1.975, 1.88, 1.785, 1.69, 1.595, 1.5], \"style\": \"dashed\", \"marker\": \"none\", \"color\": \"C1\"}, {\"label\": \"Stage and restore\", \"y\": [6.0, 6.0, 5.91, 5.8025, 5.695, 5.5875, 5.48, 5.3725, 5.265, 5.1575, 5.05, 4.9425, 4.835, 4.7275, 4.62, 4.5125, 4.405, 4.2975, 4.19, 4.0825, 3.975, 3.8675, 3.76, 3.6525, 3.545, 3.4375, 3.33, 3.2225, 3.115, 3.0075, 2.9, 2.7925, 2.685, 2.5775, 2.47, 2.3625, 2.255, 2.1475, 2.04, 1.9325, 1.825, 1.7175, 1.61, 1.5025, 1.395, 1.2875, 1.18, 1.0725, 0.965, 0.8575, 0.75], \"style\": \"dashdot\", \"marker\": \"none\", \"color\": \"C2\"}, {\"label\": \"Full policy\", \"y\": [5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 4.9425, 4.835, 4.7275, 4.62, 4.5125, 4.405, 4.2975, 4.19, 4.0825, 3.975, 3.8675, 3.76, 3.6525, 3.545, 3.4375, 3.33, 3.2225, 3.115, 3.0075, 2.9, 2.7925, 2.685, 2.5775, 2.47, 2.3625, 2.255, 2.1475, 2.04, 1.9325, 1.825, 1.7175, 1.61, 1.5025, 1.395, 1.2875, 1.18, 1.0725, 0.965, 0.8575, 0.75], \"style\": \"solid\", \"marker\": \"none\", \"color\": \"C3\"}], \"xlim\": [0.48, 1.02], \"ylim\": [0, 6.5], \"legend\": \"upper center\", \"size\": [5.1, 2.5]}"}],"options":{}}