{"as_of":"2026-08-21T22:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8cbea4871f62345a7f7ddcdf882c07edb9d97b571cbeaee1bb186814a3675520","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:58:55.946706Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2507.12748/citation-record","integrity":"/paper/2507.12748/integrity","json":"/paper/2507.12748/citation-record.json","paper":"/paper/2507.12748"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:59:00.975970Z","title":"Covering and packing in graphs IV: Linear arboricity","venue":null,"work_id":"801f1a7a-c212-4393-83c6-b0cc3fcf48c7","year":1981},"citing_paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T16:58:53.804416Z"},"links":{"citing_paper":"/paper/2507.12748"},"observation_digest":"sha256:d77aa604d8f72d0e8bef582a5cb9278ffa948f106b4484e82b52e5b260cdb80a","observation_id":"692d94f0-9b91-4b39-b126-2574ae3cf9a9","resolution":{"observed_at":"2026-08-06T16:59:01.073240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T16:59:00.712425Z","title":"Path decompositions of digraphs","venue":null,"work_id":"dd4cbcb6-f073-4f13-99be-75dbb08453f0","year":1974},"citing_paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T16:58:53.910121Z"},"links":{"citing_paper":"/paper/2507.12748"},"observation_digest":"sha256:0547118bfc13e6120aaf1b597d7e2c38f274f7b3079c34f3dae8334810a74b8f","observation_id":"8ed33c25-345f-443d-b0ae-46b0faf87e66","resolution":{"observed_at":"2026-08-06T16:59:00.827434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T16:59:00.432113Z","title":"University of Chicago, 1988","venue":null,"work_id":"8daf0215-8f8b-44c4-ae48-3963083860a0","year":1988},"citing_paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T16:58:53.987857Z"},"links":{"citing_paper":"/paper/2507.12748"},"observation_digest":"sha256:5cd67179fbb7061646b277fc4537ff27d8438e4a1401e3076633977c4bd55928","observation_id":"407c6898-7813-41c7-aaa7-775fefafeb91","resolution":{"observed_at":"2026-08-06T16:59:00.586200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T16:59:00.115644Z","title":"On the assignment polytope","venue":null,"work_id":"0d186457-34d6-4ae6-a646-625aba00e4a2","year":1974},"citing_paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T16:58:54.099527Z"},"links":{"citing_paper":"/paper/2507.12748"},"observation_digest":"sha256:2a02f730163260cdcb2e8ff6ee418f330bbbb6b94e0a6e1f09b1df2976dc6760","observation_id":"001c390e-8b18-41e3-892b-199be360c96e","resolution":{"observed_at":"2026-08-06T16:59:00.271802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T16:58:59.850291Z","title":"A proof of a conjecture of bondy concerning paths in weighted digraphs","venue":null,"work_id":"a6ebe15d-67f4-4f20-9041-9eb8e1e0a37d","year":1996},"citing_paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T16:58:54.194870Z"},"links":{"citing_paper":"/paper/2507.12748"},"observation_digest":"sha256:32f35830600b958e19d4a947c4759849fa07f80261afda640f440160c9544e1c","observation_id":"e3b000b8-3787-4ab1-a9f5-d34ec451c451","resolution":{"observed_at":"2026-08-06T16:58:59.969680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T16:58:59.525475Z","title":"On the diameter of partition polytopes and vertex-disjoint cycle cover","venue":null,"work_id":"35106311-a4fe-40c3-854c-ebfdf4e51cb3","year":2013},"citing_paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T16:58:54.282181Z"},"links":{"citing_paper":"/paper/2507.12748"},"observation_digest":"sha256:db792dc92c969400fd77704499bd21cde19aeb95b3c0f64c2c0172c02d40f22d","observation_id":"6f672ba3-5239-4b41-a88a-d7494cf905eb","resolution":{"observed_at":"2026-08-06T16:58:59.669536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.06487","last_updated":"2023-06-10T17:03:27Z","snapshot_observed_at":"2026-08-18T10:03:21.140435Z","submitted_at":"2023-06-10T17:03:27Z","title":"Path Odd-Covers of Graphs","version":1},"cited_work":{"arxiv_id":"2306.06487","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.06487","snapshot_observed_at":"2026-08-06T16:58:56.388364Z","title":"Path Odd-Covers of Graphs","venue":"math.CO","work_id":"d68ee061-16eb-4cb9-be9b-7d2b5e7aebaa","year":2023},"citing_paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T16:58:54.382918Z"},"links":{"cited_paper":"/paper/2306.06487","citing_paper":"/paper/2507.12748"},"observation_digest":"sha256:93cf66f5289259f469bb08abe05a9bcc1b929392bb34a4f259c73a9c601e884e","observation_id":"17af7afd-d030-4e1a-a6c1-cc9cbf91d547","resolution":{"observed_at":"2026-08-06T16:58:56.448362Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T16:58:59.255499Z","title":"The diameters of network-flow polytopes satisfy the Hirsch conjecture","venue":null,"work_id":"63fc741e-4bda-47a3-8eb5-dc421694ed5b","year":2018},"citing_paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T16:58:54.466261Z"},"links":{"citing_paper":"/paper/2507.12748"},"observation_digest":"sha256:b048203d6004efd011aea09c68d8d73111402fdacc5214dea6d77ede9314f96c","observation_id":"c9691f75-495c-4695-b116-b0fb683add3c","resolution":{"observed_at":"2026-08-06T16:58:59.385423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T16:58:59.027434Z","title":"Constructing Clustering Transformations","venue":null,"work_id":"1b3e0ed9-f1de-4835-8eb1-9b741324c1e7","year":2021},"citing_paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T16:58:54.617383Z"},"links":{"citing_paper":"/paper/2507.12748"},"observation_digest":"sha256:f1309b4b7c8ca325b34f4a96587aa80d83fb09e1f3acfdefb0dfa620113a3edc","observation_id":"756ed3ec-680a-4e66-855c-5c68bbbf46e8","resolution":{"observed_at":"2026-08-06T16:58:59.152294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.08598","last_updated":"2024-08-16T08:20:11Z","snapshot_observed_at":"2026-08-21T04:36:50.019302Z","submitted_at":"2024-08-16T08:20:11Z","title":"On odd covers of cliques and disjoint unions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.08598","snapshot_observed_at":"2026-08-06T16:58:54.716532Z","title":"On odd covers of cliques and disjoint unions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T16:58:54.716532Z"},"links":{"cited_paper":"/paper/2408.08598","citing_paper":"/paper/2507.12748"},"observation_digest":"sha256:0c443eb49ba2c1d099a1a1d752c8648158f0903a9390c9ec35729c723bf9758a","observation_id":"744652f1-f966-4ba9-b318-72a0bdb28944","resolution":{"observed_at":"2026-08-06T16:58:54.716532Z","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.1002/jgt.22970","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Odd covers of graphs","venue":"Journal of Graph Theory","work_id":"b269ca46-80b0-4ff6-b0fa-36963672dde0","year":2023},"citing_paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T16:58:54.837138Z"},"links":{"citing_paper":"/paper/2507.12748"},"observation_digest":"sha256:52806474e748f91f8e1bc3301b9f87516283be1d59c1f1b97458ed4b0bfec796","observation_id":"3a7f4bf8-b914-4c06-88d9-8d77999554d3","resolution":{"observed_at":"2026-08-06T16:58:56.201360Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T16:58:58.744117Z","title":"On the coverings of graphs","venue":null,"work_id":"adbeb2bb-7376-4ff9-87f0-6b9a8c35ca7d","year":1980},"citing_paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T16:58:54.908965Z"},"links":{"citing_paper":"/paper/2507.12748"},"observation_digest":"sha256:a05894a3422894b843540397f9a87f4eb6578b9f9d5b2d72c7201594b9f4e8e0","observation_id":"4219043f-6751-4c71-896f-fbcaa8f6d1b3","resolution":{"observed_at":"2026-08-06T16:58:58.926681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T16:58:58.428751Z","title":"On some of my conjectures in number theory and combinatorics","venue":null,"work_id":"720b7e01-d20b-4f73-bc5c-6ec5a74ccfec","year":1983},"citing_paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T16:58:55.027971Z"},"links":{"citing_paper":"/paper/2507.12748"},"observation_digest":"sha256:14123f463efd0c13df84735cb940264de7946e4a5e10a27edd538ef8f93222f1","observation_id":"5df7ab86-ba1c-419b-8372-fd5f9f583ce3","resolution":{"observed_at":"2026-08-06T16:58:58.618465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T16:58:58.148019Z","title":"Covers of Eulerian graphs","venue":null,"work_id":"6e376b51-29e4-4427-9783-2547ce0e2d78","year":null},"citing_paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T16:58:55.128955Z"},"links":{"citing_paper":"/paper/2507.12748"},"observation_digest":"sha256:19b4f4c1c276e3c20094ede464f8e0f5a84422c22c0b6efa6034dab5b21ebb9f","observation_id":"c77c09c1-0223-424b-9b4d-d08cd1dc95a4","resolution":{"observed_at":"2026-08-06T16:58:58.302045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T16:58:57.849592Z","title":"On the addressing problem for loop switching","venue":null,"work_id":"c9b1409f-598d-4586-b6f7-da1aae158f30","year":1971},"citing_paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T16:58:55.241528Z"},"links":{"citing_paper":"/paper/2507.12748"},"observation_digest":"sha256:9593446139772d7c22c0ab7119f7dee767d6f212c1ddb25cc0518bb13a52b41e","observation_id":"622e2e39-8eea-45a5-b2c9-2355c02b626d","resolution":{"observed_at":"2026-08-06T16:58:57.992233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T16:58:57.586202Z","title":"On embedding graphs in squashed cubes","venue":null,"work_id":"60dd966c-268f-4ee6-a53f-f97beb97c2f5","year":1972},"citing_paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T16:58:55.354947Z"},"links":{"citing_paper":"/paper/2507.12748"},"observation_digest":"sha256:4d229668fa7f8a12cb658d535b1468cf8821991b213d10a56526edee8049d268","observation_id":"05e0d60c-d407-4ee9-b68e-8be813f20f15","resolution":{"observed_at":"2026-08-06T16:58:57.733533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T16:58:57.322325Z","title":"Facets and vertices of transportation polyhedra","venue":null,"work_id":"aef21ee1-1d5c-4723-83df-36ab0a3d7f41","year":1968},"citing_paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T16:58:55.429865Z"},"links":{"citing_paper":"/paper/2507.12748"},"observation_digest":"sha256:7ef5c02d77439458602967c63408ed22a12db8b7fcec8c84addfead85a17bcc4","observation_id":"4a3d3f05-9b68-4ae8-8a6e-83a3b1043921","resolution":{"observed_at":"2026-08-06T16:58:57.465958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.05053","last_updated":"2024-08-09T13:20:21Z","snapshot_observed_at":"2026-08-21T21:37:48.929447Z","submitted_at":"2024-08-09T13:20:21Z","title":"Odd Covers of Complete Graphs and Hypergraphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.05053","snapshot_observed_at":"2026-08-06T16:58:55.564015Z","title":"Odd covers of complete graphs and hypergraphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T16:58:55.564015Z"},"links":{"cited_paper":"/paper/2408.05053","citing_paper":"/paper/2507.12748"},"observation_digest":"sha256:400d7d2a6ceb2aff036cd5b34bb71c3ac8367b876f1842fd0274415de6582804","observation_id":"f3bfbc90-442b-4fe4-9627-07b65ee9ae76","resolution":{"observed_at":"2026-08-06T16:58:55.564015Z","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-06T16:58:57.064741Z","title":"On covering of graphs","venue":null,"work_id":"1c7f50c0-9959-4901-916f-cec440d5ca54","year":1966},"citing_paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T16:58:55.677955Z"},"links":{"citing_paper":"/paper/2507.12748"},"observation_digest":"sha256:92ace49cd9cf89bc2bd29c8457caccf3a39cd228f809de15d9c98d3d073ad3b6","observation_id":"1ffb3376-a90c-4458-8c59-1920cfe3b55b","resolution":{"observed_at":"2026-08-06T16:58:57.188018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T16:58:56.821551Z","title":"Linear arboricity of digraphs","venue":null,"work_id":"7a72e719-4c6c-4cfa-ab89-ee0fa7d70000","year":1987},"citing_paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T16:58:55.793984Z"},"links":{"citing_paper":"/paper/2507.12748"},"observation_digest":"sha256:eb345c53de9e4e2bed3fe105957cf6cbbe9e77cd5aed2aea948a96bf097886f3","observation_id":"99c08e1c-2874-456e-8c66-c4ee5a387f3e","resolution":{"observed_at":"2026-08-06T16:58:56.932042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T16:58:56.525416Z","title":"Die Theorie der regul¨ aren Graphs","venue":null,"work_id":"51764f45-2c40-4548-ab98-2d08b180548c","year":null},"citing_paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T16:58:55.946706Z"},"links":{"citing_paper":"/paper/2507.12748"},"observation_digest":"sha256:2e0f4bc1da01ab68ad084eb16e554d7b08b46a89117850e14f1cc5fadc084c90","observation_id":"e1ae43de-40b1-4ed9-9212-47bf8bafc6f7","resolution":{"observed_at":"2026-08-06T16:58:56.644795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.12748","last_updated":"2025-07-28T23:54:02Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-18T10:12:16.507938Z","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":2,"verified_fuzzy":17},"total_outbound_references":21},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2507.12748."}