{"as_of":"2026-08-22T20:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:262ce82ce366e1f982df27f76e33a945b9c1ee327436a5f50a433346e937ef26","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-24T15:30:42.423094Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/1907.11600/citation-record","integrity":"/paper/1907.11600/integrity","json":"/paper/1907.11600/citation-record.json","paper":"/paper/1907.11600"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bar´ at and C","venue":null,"work_id":"d1226be0-6524-4041-8e4b-04c5f5e5a801","year":2006},"citing_paper":{"arxiv_id":"1907.11600","last_updated":"2019-07-26T14:44:17Z","snapshot_observed_at":"2026-08-04T22:33:14.798457Z","submitted_at":"2019-07-26T14:44:17Z","title":"Edge-partitioning 3-edge-connected graphs into paths","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-24T15:30:42.423094Z"},"links":{"citing_paper":"/paper/1907.11600"},"observation_digest":"sha256:9869c67d03cbe475347addefd129f0c77eed2e5e4d43b8133a19ad9b5a423007","observation_id":"dfa594f4-b721-4df4-b468-a0bdbbe7acb9","resolution":{"observed_at":"2026-05-24T15:34:39.840323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-06-05T21:23:00.469572Z","title":"Bensmail, A","venue":null,"work_id":"ab276e24-85f3-4428-b977-7a7a95aabe98","year":2017},"citing_paper":{"arxiv_id":"1907.11600","last_updated":"2019-07-26T14:44:17Z","snapshot_observed_at":"2026-08-04T22:33:14.798457Z","submitted_at":"2019-07-26T14:44:17Z","title":"Edge-partitioning 3-edge-connected graphs into paths","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-24T15:30:42.423094Z"},"links":{"citing_paper":"/paper/1907.11600"},"observation_digest":"sha256:29e16b326a817733260888930f70e6c0910b09460c6c71027d29b3982fa9e005","observation_id":"60da8abf-c0af-4447-b548-3797bdcbc506","resolution":{"observed_at":"2026-05-24T15:34:39.836504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-06-05T21:23:00.469572Z","title":"Bensmail, A","venue":null,"work_id":"cbb7523b-a3c2-4cac-93b3-54bb32238a8a","year":2019},"citing_paper":{"arxiv_id":"1907.11600","last_updated":"2019-07-26T14:44:17Z","snapshot_observed_at":"2026-08-04T22:33:14.798457Z","submitted_at":"2019-07-26T14:44:17Z","title":"Edge-partitioning 3-edge-connected graphs into paths","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-24T15:30:42.423094Z"},"links":{"citing_paper":"/paper/1907.11600"},"observation_digest":"sha256:c263ae3da92d69c66d226114de99911390da4714a55f30869411eed81fdb0af2","observation_id":"9ed7a4d3-8584-43b8-bd8d-f4e4c0b92139","resolution":{"observed_at":"2026-05-24T15:34:39.833207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-06-05T21:23:00.469572Z","title":"Erd˝ os and L","venue":null,"work_id":"d22354ab-7b5b-4687-a5bb-72e09186d601","year":1975},"citing_paper":{"arxiv_id":"1907.11600","last_updated":"2019-07-26T14:44:17Z","snapshot_observed_at":"2026-08-04T22:33:14.798457Z","submitted_at":"2019-07-26T14:44:17Z","title":"Edge-partitioning 3-edge-connected graphs into paths","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-24T15:30:42.423094Z"},"links":{"citing_paper":"/paper/1907.11600"},"observation_digest":"sha256:011fbdfa4c69c1f246d95fedcfb58e025da757e006601801c9b8ca83e0676eb8","observation_id":"b7b81890-8d69-4bf0-814a-1098f3c9c71e","resolution":{"observed_at":"2026-05-24T15:34:39.829881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-06-05T21:23:00.469572Z","title":"Frank, T","venue":null,"work_id":"720f4c39-eb84-4965-b2c2-1c10874fa2cd","year":2003},"citing_paper":{"arxiv_id":"1907.11600","last_updated":"2019-07-26T14:44:17Z","snapshot_observed_at":"2026-08-04T22:33:14.798457Z","submitted_at":"2019-07-26T14:44:17Z","title":"Edge-partitioning 3-edge-connected graphs into paths","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-24T15:30:42.423094Z"},"links":{"citing_paper":"/paper/1907.11600"},"observation_digest":"sha256:6f70aa2116a723d0b33cd5f3154c2aabc46b185b6d61d596a6abb2762659c2a7","observation_id":"dca11952-fd61-472f-9c38-40f135ad9a48","resolution":{"observed_at":"2026-05-24T15:34:39.826567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"906a8e07-8a6b-4137-8632-dab2d3d75ecf","year":1993},"citing_paper":{"arxiv_id":"1907.11600","last_updated":"2019-07-26T14:44:17Z","snapshot_observed_at":"2026-08-04T22:33:14.798457Z","submitted_at":"2019-07-26T14:44:17Z","title":"Edge-partitioning 3-edge-connected graphs into paths","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-24T15:30:42.423094Z"},"links":{"citing_paper":"/paper/1907.11600"},"observation_digest":"sha256:2f712c4a4049c357a02d36f39395ab54eb6f8bff8d08bf0478c70e4173e59dcb","observation_id":"6985324f-7908-4f1e-81f5-35f24e004cc3","resolution":{"observed_at":"2026-05-24T15:34:39.822442Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.03704","last_updated":"2018-03-09T21:49:50Z","snapshot_observed_at":"2026-08-14T19:37:40.970684Z","submitted_at":"2018-03-09T21:49:50Z","title":"Edge-decomposing graphs into coprime forests","version":1},"cited_work":{"arxiv_id":"1803.03704","doi":null,"metadata_source":"pith","pith_arxiv_id":"1803.03704","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Edge-decomposing graphs into coprime forests","venue":"math.CO","work_id":"dc435ec2-30f7-4d71-9b5a-3c701ca9620e","year":2018},"citing_paper":{"arxiv_id":"1907.11600","last_updated":"2019-07-26T14:44:17Z","snapshot_observed_at":"2026-08-04T22:33:14.798457Z","submitted_at":"2019-07-26T14:44:17Z","title":"Edge-partitioning 3-edge-connected graphs into paths","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-24T15:30:42.423094Z"},"links":{"cited_paper":"/paper/1803.03704","citing_paper":"/paper/1907.11600"},"observation_digest":"sha256:e48567036f140e64f65bbf744e87e984a355363bc3fb89c230179ba6094b8623","observation_id":"a5d0e313-cccb-4ec2-b7f1-a46322ac2271","resolution":{"observed_at":"2026-05-24T15:34:38.270978Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-06-05T21:23:00.469572Z","title":"Lov´ asz","venue":null,"work_id":"e9aeabe9-e5ad-4521-8327-3004f046fe88","year":1970},"citing_paper":{"arxiv_id":"1907.11600","last_updated":"2019-07-26T14:44:17Z","snapshot_observed_at":"2026-08-04T22:33:14.798457Z","submitted_at":"2019-07-26T14:44:17Z","title":"Edge-partitioning 3-edge-connected graphs into paths","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-24T15:30:42.423094Z"},"links":{"citing_paper":"/paper/1907.11600"},"observation_digest":"sha256:6480a3d7800af70dc061bf66db4afa5198309bb9c7a5ab984eacb3fcf655bc90","observation_id":"f51d41e1-9491-4bef-bf26-a2a7ba895f36","resolution":{"observed_at":"2026-05-24T15:34:39.818562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"959caee9-4e72-4f7d-be32-573e4cd9a19a","year":2013},"citing_paper":{"arxiv_id":"1907.11600","last_updated":"2019-07-26T14:44:17Z","snapshot_observed_at":"2026-08-04T22:33:14.798457Z","submitted_at":"2019-07-26T14:44:17Z","title":"Edge-partitioning 3-edge-connected graphs into paths","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-24T15:30:42.423094Z"},"links":{"citing_paper":"/paper/1907.11600"},"observation_digest":"sha256:505082e365657a74d9c70ec1db44b33080e65190c0d02136894484adfaac3e2c","observation_id":"3a8d76ac-4221-43d0-923d-51190e7c4c5a","resolution":{"observed_at":"2026-05-24T15:34:39.814778Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d2e3158d-487f-412d-8ba1-9e8b8e273451","year":1978},"citing_paper":{"arxiv_id":"1907.11600","last_updated":"2019-07-26T14:44:17Z","snapshot_observed_at":"2026-08-04T22:33:14.798457Z","submitted_at":"2019-07-26T14:44:17Z","title":"Edge-partitioning 3-edge-connected graphs into paths","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-24T15:30:42.423094Z"},"links":{"citing_paper":"/paper/1907.11600"},"observation_digest":"sha256:a42de7f5996b930445ddb8fc35e694b130478c5cfbde61f6136eeb012b4d2402","observation_id":"9b18ebd6-0fad-4af8-8a4d-fa2d2a05ec61","resolution":{"observed_at":"2026-05-24T15:34:39.811161Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4c94ced6-e113-4f92-9a92-6100ca9a89f0","year":2010},"citing_paper":{"arxiv_id":"1907.11600","last_updated":"2019-07-26T14:44:17Z","snapshot_observed_at":"2026-08-04T22:33:14.798457Z","submitted_at":"2019-07-26T14:44:17Z","title":"Edge-partitioning 3-edge-connected graphs into paths","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-24T15:30:42.423094Z"},"links":{"citing_paper":"/paper/1907.11600"},"observation_digest":"sha256:dddd03adf7e3e1209ef8ee06b0b2f09a6e6b71603f62158295cdcae7bef98da8","observation_id":"04223f96-d22b-4c8d-b946-94c593feab3b","resolution":{"observed_at":"2026-05-24T15:34:39.807570Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-06-05T21:23:00.469572Z","title":"Thomassen","venue":null,"work_id":"791575c4-eb76-4073-bfa9-a864e79b0fcf","year":2012},"citing_paper":{"arxiv_id":"1907.11600","last_updated":"2019-07-26T14:44:17Z","snapshot_observed_at":"2026-08-04T22:33:14.798457Z","submitted_at":"2019-07-26T14:44:17Z","title":"Edge-partitioning 3-edge-connected graphs into paths","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-24T15:30:42.423094Z"},"links":{"citing_paper":"/paper/1907.11600"},"observation_digest":"sha256:601ac28a0fe3f8c5e20f9956a251207e0467335cf2774a2609429551b6f1cfd4","observation_id":"b680cae6-6353-4177-aaa6-3aa2d25214a7","resolution":{"observed_at":"2026-05-24T15:34:39.803855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-06-05T21:23:00.469572Z","title":"Thomassen","venue":null,"work_id":"060bba07-0f23-4c3e-a6a1-592213b6563f","year":2013},"citing_paper":{"arxiv_id":"1907.11600","last_updated":"2019-07-26T14:44:17Z","snapshot_observed_at":"2026-08-04T22:33:14.798457Z","submitted_at":"2019-07-26T14:44:17Z","title":"Edge-partitioning 3-edge-connected graphs into paths","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-24T15:30:42.423094Z"},"links":{"citing_paper":"/paper/1907.11600"},"observation_digest":"sha256:3158f0969387bde47e6c20c89b485bfdc5cb001827573e17b231110c29a6c251","observation_id":"5be1d5cb-052d-4905-8cce-48ecbfe4ce77","resolution":{"observed_at":"2026-05-24T15:34:39.800351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1907.11600","last_updated":"2019-07-26T14:44:17Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-04T22:33:14.798457Z","submitted_at":"2019-07-26T14:44:17Z","title":"Edge-partitioning 3-edge-connected graphs into paths"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":8},"total_outbound_references":13},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:1907.11600."}