{"as_of":"2026-08-16T10:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5831ee1cfde7e5ba89311932f3b33c4b6e32206454d5eb9d2fb2f355551a2e84","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:31:30.716245Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.08938/citation-record","integrity":"/paper/1908.08938/integrity","json":"/paper/1908.08938/citation-record.json","paper":"/paper/1908.08938"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:30.629228Z","title":null,"venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"1908.08938","last_updated":"2019-08-23T17:59:39Z","snapshot_observed_at":"2026-08-14T11:23:13.458915Z","submitted_at":"2019-08-23T17:59:39Z","title":"Mixed Linear Layouts: Complexity, Heuristics, and Experiments","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:30.629228Z"},"links":{"citing_paper":"/paper/1908.08938"},"observation_digest":"sha256:2aa96f600bae009d29c1e0ff1709c01b9084f7b0c2326fc39114b4fb25adbbc8","observation_id":"0df204b3-3d19-4fe5-a260-5b230502b243","resolution":{"observed_at":"2026-08-14T11:31:30.629228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:30.636085Z","title":null,"venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"1908.08938","last_updated":"2019-08-23T17:59:39Z","snapshot_observed_at":"2026-08-14T11:23:13.458915Z","submitted_at":"2019-08-23T17:59:39Z","title":"Mixed Linear Layouts: Complexity, Heuristics, and Experiments","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:30.636085Z"},"links":{"citing_paper":"/paper/1908.08938"},"observation_digest":"sha256:4dea668848644278853d47ec0bb69f633f10b8a9b0ffa8a346468d3421213360","observation_id":"565c7002-d261-4f23-aea2-a586ac07047e","resolution":{"observed_at":"2026-08-14T11:31:30.636085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0166-218x(01)00314-6","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:30.842746Z","title":"Discrete Applied Mathematics 122(1-3), 93–115 (2002)","venue":null,"work_id":"ec6f7e0e-4b41-49a3-b7cb-066e62519fa2","year":2002},"citing_paper":{"arxiv_id":"1908.08938","last_updated":"2019-08-23T17:59:39Z","snapshot_observed_at":"2026-08-14T11:23:13.458915Z","submitted_at":"2019-08-23T17:59:39Z","title":"Mixed Linear Layouts: Complexity, Heuristics, and Experiments","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:30.641643Z"},"links":{"citing_paper":"/paper/1908.08938"},"observation_digest":"sha256:581eddc136fa7619f6fdc4c6a491402873cc22ac2ec66320d2978afd202e2b4e","observation_id":"a9abad55-914c-4131-8a77-fbc4622c18fe","resolution":{"observed_at":"2026-08-14T11:31:30.847889Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.04791","last_updated":"2020-04-30T01:39:59Z","snapshot_observed_at":"2026-08-16T07:07:47.897219Z","submitted_at":"2019-04-09T17:11:16Z","title":"Planar graphs have bounded queue-number","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.04791","snapshot_observed_at":"2026-08-14T11:31:30.647762Z","title":"CoRR abs/1904.04791 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.08938","last_updated":"2019-08-23T17:59:39Z","snapshot_observed_at":"2026-08-14T11:23:13.458915Z","submitted_at":"2019-08-23T17:59:39Z","title":"Mixed Linear Layouts: Complexity, Heuristics, and Experiments","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:30.647762Z"},"links":{"cited_paper":"/paper/1904.04791","citing_paper":"/paper/1908.08938"},"observation_digest":"sha256:ba876a0364976030ef4cf41f1eaeef5a7d3fa5a4558cf4797556e076d0b19aab","observation_id":"58687648-26ac-4f5d-a251-5e92474d2175","resolution":{"observed_at":"2026-08-14T11:31:30.647762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:30.961678Z","title":"Discrete Math","venue":null,"work_id":"c4a804ec-5e7b-467a-ad55-68f292557498","year":2004},"citing_paper":{"arxiv_id":"1908.08938","last_updated":"2019-08-23T17:59:39Z","snapshot_observed_at":"2026-08-14T11:23:13.458915Z","submitted_at":"2019-08-23T17:59:39Z","title":"Mixed Linear Layouts: Complexity, Heuristics, and Experiments","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:30.653445Z"},"links":{"citing_paper":"/paper/1908.08938"},"observation_digest":"sha256:4dd38e79b87fd883882d363c85fb2d303c56321a541e05ea0aaf697f66ebf765","observation_id":"09b4210e-267d-494c-b166-c77f697b51da","resolution":{"observed_at":"2026-08-14T11:31:30.967718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:30.658976Z","title":"Discrete & Computational Geometry 13, 459–468 (1995)","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"1908.08938","last_updated":"2019-08-23T17:59:39Z","snapshot_observed_at":"2026-08-14T11:23:13.458915Z","submitted_at":"2019-08-23T17:59:39Z","title":"Mixed Linear Layouts: Complexity, Heuristics, and Experiments","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:30.658976Z"},"links":{"citing_paper":"/paper/1908.08938"},"observation_digest":"sha256:26c4e4ebdc9882a1c53aadd650843fc6d213d200968060ec6e9581b5b3d56b99","observation_id":"83b19321-b838-4bc9-b2ad-df00854dc812","resolution":{"observed_at":"2026-08-14T11:31:30.658976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:30.941432Z","title":"In: Workshop on Information Technologies - Applications and Theory (ITAT) (2004)","venue":null,"work_id":"a86beaca-46bf-4888-af42-eadd7a67ee75","year":2004},"citing_paper":{"arxiv_id":"1908.08938","last_updated":"2019-08-23T17:59:39Z","snapshot_observed_at":"2026-08-14T11:23:13.458915Z","submitted_at":"2019-08-23T17:59:39Z","title":"Mixed Linear Layouts: Complexity, Heuristics, and Experiments","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:30.665087Z"},"links":{"citing_paper":"/paper/1908.08938"},"observation_digest":"sha256:925ee7b4e8d7f0c6282424883f2887097d7d39ba88307ae3a4d78047dfa33bbd","observation_id":"f48b9e8d-eda5-4f76-ba7b-598e291263a9","resolution":{"observed_at":"2026-08-14T11:31:30.946977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:30.670323Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"1908.08938","last_updated":"2019-08-23T17:59:39Z","snapshot_observed_at":"2026-08-14T11:23:13.458915Z","submitted_at":"2019-08-23T17:59:39Z","title":"Mixed Linear Layouts: Complexity, Heuristics, and Experiments","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:30.670323Z"},"links":{"citing_paper":"/paper/1908.08938"},"observation_digest":"sha256:99735b6100840af3cc2c86463427ba0c19a4901ef36a710c8b42bdcaed0fb486","observation_id":"afde1db1-4ae0-4a38-aa3e-2e4b83247eb9","resolution":{"observed_at":"2026-08-14T11:31:30.670323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:30.676438Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"1908.08938","last_updated":"2019-08-23T17:59:39Z","snapshot_observed_at":"2026-08-14T11:23:13.458915Z","submitted_at":"2019-08-23T17:59:39Z","title":"Mixed Linear Layouts: Complexity, Heuristics, and Experiments","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:30.676438Z"},"links":{"citing_paper":"/paper/1908.08938"},"observation_digest":"sha256:1b8614c72e3c276f230b8a929e4eadaa21f75c001d29e31f2dfbf4204ec72dcb","observation_id":"81faaa25-6c28-4c8e-b3f7-3648c6768b56","resolution":{"observed_at":"2026-08-14T11:31:30.676438Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:30.923649Z","title":"In: 4th Southeastern Conference on Combinatorics, Graph Theory and Computing","venue":null,"work_id":"4d29c39d-bb98-40ca-bf78-b817ebbe65c3","year":1973},"citing_paper":{"arxiv_id":"1908.08938","last_updated":"2019-08-23T17:59:39Z","snapshot_observed_at":"2026-08-14T11:23:13.458915Z","submitted_at":"2019-08-23T17:59:39Z","title":"Mixed Linear Layouts: Complexity, Heuristics, and Experiments","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:30.688104Z"},"links":{"citing_paper":"/paper/1908.08938"},"observation_digest":"sha256:96898f73eee8131f5c7a80eb32f2578b9a651eafc7e9d456027b180a02d3d366","observation_id":"15adc46a-fcdb-4fb2-9569-f45b6f6e7757","resolution":{"observed_at":"2026-08-14T11:31:30.929562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:30.905629Z","title":"In: Frati, F., Ma, K.L","venue":null,"work_id":"35585bce-7ec7-4bbe-9ef4-1eb3454526c0","year":null},"citing_paper":{"arxiv_id":"1908.08938","last_updated":"2019-08-23T17:59:39Z","snapshot_observed_at":"2026-08-14T11:23:13.458915Z","submitted_at":"2019-08-23T17:59:39Z","title":"Mixed Linear Layouts: Complexity, Heuristics, and Experiments","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:30.693485Z"},"links":{"citing_paper":"/paper/1908.08938"},"observation_digest":"sha256:73150ec150d06b44e999b03eda5bb1546e9512d017ea6d38dc1a88eb431d9c72","observation_id":"1a57cfe7-313b-410f-ab30-56f2af88dc9a","resolution":{"observed_at":"2026-08-14T11:31:30.910887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s12293-013-0115-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:30.774575Z","title":"Memetic Computing 5(4), 255–274 (2013)","venue":null,"work_id":"53792bbb-0c65-4d30-8309-09ffb9ed5dad","year":2013},"citing_paper":{"arxiv_id":"1908.08938","last_updated":"2019-08-23T17:59:39Z","snapshot_observed_at":"2026-08-14T11:23:13.458915Z","submitted_at":"2019-08-23T17:59:39Z","title":"Mixed Linear Layouts: Complexity, Heuristics, and Experiments","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:30.705581Z"},"links":{"citing_paper":"/paper/1908.08938"},"observation_digest":"sha256:f336814dbcbbcc5ce8289ccd3560321b36b06758455d94cf62821dc027d64e6f","observation_id":"55999fbb-05cc-4c3f-a20d-a6b15458eb94","resolution":{"observed_at":"2026-08-14T11:31:30.782049Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:30.711065Z","title":"In: STACS 88, 5th Annual Sym- posium on Theoretical Aspects of Computer Science, Bordeaux, France, February 11-13, 1988, Proceedings","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"1908.08938","last_updated":"2019-08-23T17:59:39Z","snapshot_observed_at":"2026-08-14T11:23:13.458915Z","submitted_at":"2019-08-23T17:59:39Z","title":"Mixed Linear Layouts: Complexity, Heuristics, and Experiments","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:30.711065Z"},"links":{"citing_paper":"/paper/1908.08938"},"observation_digest":"sha256:1ed95e8bcb06d976cf92bede5aee19d1f4983483b41250db883e96982327910b","observation_id":"1755bc65-7122-452b-9082-a79aa405379e","resolution":{"observed_at":"2026-08-14T11:31:30.711065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:30.716245Z","title":null,"venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"1908.08938","last_updated":"2019-08-23T17:59:39Z","snapshot_observed_at":"2026-08-14T11:23:13.458915Z","submitted_at":"2019-08-23T17:59:39Z","title":"Mixed Linear Layouts: Complexity, Heuristics, and Experiments","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:30.716245Z"},"links":{"citing_paper":"/paper/1908.08938"},"observation_digest":"sha256:9881ad81cb219e639ba817693d187cc77aa9594e91e41c2edc0ed3d2c61f6c62","observation_id":"2a4a4cb7-fbcd-4769-8d06-bb503c1b81a7","resolution":{"observed_at":"2026-08-14T11:31:30.716245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:30.699689Z","title":"https://doi.org/10.1007/978-3-319-73915-1 17","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.08938","last_updated":"2019-08-23T17:59:39Z","snapshot_observed_at":"2026-08-14T11:23:13.458915Z","submitted_at":"2019-08-23T17:59:39Z","title":"Mixed Linear Layouts: Complexity, Heuristics, and Experiments","version":1},"reference_index":209,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:30.699689Z"},"links":{"citing_paper":"/paper/1908.08938"},"observation_digest":"sha256:6bd871ef2ab04b96e030bdbe2e4f22f5209cab4435df11252bbed4e8f8800d3e","observation_id":"b8a634af-35b6-43a8-aebe-27bfdcfe8b4c","resolution":{"observed_at":"2026-08-14T11:31:30.699689Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.08938","last_updated":"2019-08-23T17:59:39Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T11:23:13.458915Z","submitted_at":"2019-08-23T17:59:39Z","title":"Mixed Linear Layouts: Complexity, Heuristics, and Experiments"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":2,"verified_fuzzy":4},"total_outbound_references":15},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:1908.08938."}