{"as_of":"2026-08-20T16:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eafef567ca25ca492a27cb738174c3113949834a33fffd45c3d8e63b55f33b10","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-30T00:52:40.514062Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2606.28599/citation-record","integrity":"/paper/2606.28599/integrity","json":"/paper/2606.28599/citation-record.json","paper":"/paper/2606.28599"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T00:52:40.514062Z","title":"Bhyravarapu, S","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.28599","last_updated":"2026-06-26T20:48:19Z","snapshot_observed_at":"2026-07-07T00:02:38.226622Z","submitted_at":"2026-06-26T20:48:19Z","title":"Algorithms for the Maximum Edge Open Packing Problem","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-30T00:52:40.514062Z"},"links":{"citing_paper":"/paper/2606.28599"},"observation_digest":"sha256:bd1375e2c0b53aec287100abf9edd18e3a4b4375c74e83dbf56b3afb5d093bfd","observation_id":"5e0f5b84-e85c-449f-ad67-a5507bc4626a","resolution":{"observed_at":"2026-06-30T00:52:40.514062Z","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-06-30T00:52:40.514062Z","title":"Breˇ sar, T","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.28599","last_updated":"2026-06-26T20:48:19Z","snapshot_observed_at":"2026-07-07T00:02:38.226622Z","submitted_at":"2026-06-26T20:48:19Z","title":"Algorithms for the Maximum Edge Open Packing Problem","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-30T00:52:40.514062Z"},"links":{"citing_paper":"/paper/2606.28599"},"observation_digest":"sha256:61cf44b7b02c6e49e72bb31aa82ac6720b806ab8cbe3de2baa2ae0438fe3607f","observation_id":"22db3cec-0e8e-42e2-a420-d1e5eda446d0","resolution":{"observed_at":"2026-06-30T00:52:40.514062Z","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-06-30T00:52:40.514062Z","title":"Breˇ sar and B","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.28599","last_updated":"2026-06-26T20:48:19Z","snapshot_observed_at":"2026-07-07T00:02:38.226622Z","submitted_at":"2026-06-26T20:48:19Z","title":"Algorithms for the Maximum Edge Open Packing Problem","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-30T00:52:40.514062Z"},"links":{"citing_paper":"/paper/2606.28599"},"observation_digest":"sha256:140fbd4177de8adf0f549be9f61337f116786da0af747745b1fce731378920e0","observation_id":"eef8fd55-529c-4fe6-91df-7e853ea010b9","resolution":{"observed_at":"2026-06-30T00:52:40.514062Z","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-06-30T00:52:40.514062Z","title":null,"venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2606.28599","last_updated":"2026-06-26T20:48:19Z","snapshot_observed_at":"2026-07-07T00:02:38.226622Z","submitted_at":"2026-06-26T20:48:19Z","title":"Algorithms for the Maximum Edge Open Packing Problem","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-30T00:52:40.514062Z"},"links":{"citing_paper":"/paper/2606.28599"},"observation_digest":"sha256:45ec657116383422a0bc59d56a03ed3350d2584720078e5b694ee5b0242d5075","observation_id":"3f34923e-702f-49c6-9d8f-adb45d91f24a","resolution":{"observed_at":"2026-06-30T00:52:40.514062Z","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-06-30T00:52:40.514062Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.28599","last_updated":"2026-06-26T20:48:19Z","snapshot_observed_at":"2026-07-07T00:02:38.226622Z","submitted_at":"2026-06-26T20:48:19Z","title":"Algorithms for the Maximum Edge Open Packing Problem","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-30T00:52:40.514062Z"},"links":{"citing_paper":"/paper/2606.28599"},"observation_digest":"sha256:6d1816177159a688e56561eb06cec04330ac5ce80df6eb71f2967d2b053cb684","observation_id":"cec64738-901b-4e08-b10d-affef614f8ff","resolution":{"observed_at":"2026-06-30T00:52:40.514062Z","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-06-30T00:52:40.514062Z","title":"Chang, S.-Y Hsieh, and G.-H","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2606.28599","last_updated":"2026-06-26T20:48:19Z","snapshot_observed_at":"2026-07-07T00:02:38.226622Z","submitted_at":"2026-06-26T20:48:19Z","title":"Algorithms for the Maximum Edge Open Packing Problem","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-30T00:52:40.514062Z"},"links":{"citing_paper":"/paper/2606.28599"},"observation_digest":"sha256:873b2e0c1332f63ba8c6e6d4bf70db026caef1f21b04dceb60b128496e24ad58","observation_id":"4a79b096-87bf-488f-a700-ae7dba6c569b","resolution":{"observed_at":"2026-06-30T00:52:40.514062Z","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-06-30T00:52:40.514062Z","title":"Chelladurai, K","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.28599","last_updated":"2026-06-26T20:48:19Z","snapshot_observed_at":"2026-07-07T00:02:38.226622Z","submitted_at":"2026-06-26T20:48:19Z","title":"Algorithms for the Maximum Edge Open Packing Problem","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-30T00:52:40.514062Z"},"links":{"citing_paper":"/paper/2606.28599"},"observation_digest":"sha256:2ea699857354dd88b06222f7b267b40f9e7b9dc87c4d2fa8280a0adaea21336b","observation_id":"1831c91b-c278-43e6-a3f2-f1516c71b2a3","resolution":{"observed_at":"2026-06-30T00:52:40.514062Z","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-06-30T00:52:40.514062Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.28599","last_updated":"2026-06-26T20:48:19Z","snapshot_observed_at":"2026-07-07T00:02:38.226622Z","submitted_at":"2026-06-26T20:48:19Z","title":"Algorithms for the Maximum Edge Open Packing Problem","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-30T00:52:40.514062Z"},"links":{"citing_paper":"/paper/2606.28599"},"observation_digest":"sha256:7f4ebd3d3a9f4854056d8b7ef2284360771e7ebf4cd4b196348208086c7fc2b0","observation_id":"a6fe3431-7d38-4d25-9aa8-1d21392933d0","resolution":{"observed_at":"2026-06-30T00:52:40.514062Z","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-06-30T00:52:40.514062Z","title":"D´ ıaz,¨O","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.28599","last_updated":"2026-06-26T20:48:19Z","snapshot_observed_at":"2026-07-07T00:02:38.226622Z","submitted_at":"2026-06-26T20:48:19Z","title":"Algorithms for the Maximum Edge Open Packing Problem","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-30T00:52:40.514062Z"},"links":{"citing_paper":"/paper/2606.28599"},"observation_digest":"sha256:69edcafe5f1835eff5844abbd73b8df22266c71202eab31b950973d9348b0533","observation_id":"157c4f36-7345-4b13-a570-505cac6e087c","resolution":{"observed_at":"2026-06-30T00:52:40.514062Z","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-06-30T00:52:40.514062Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.28599","last_updated":"2026-06-26T20:48:19Z","snapshot_observed_at":"2026-07-07T00:02:38.226622Z","submitted_at":"2026-06-26T20:48:19Z","title":"Algorithms for the Maximum Edge Open Packing Problem","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-30T00:52:40.514062Z"},"links":{"citing_paper":"/paper/2606.28599"},"observation_digest":"sha256:27f55a03ecba75b3697b5c06cb9b08c73b79a530756fcb6ea7d9a5e5f97eacad","observation_id":"6fd232e8-8563-4e0a-ac27-b5a9a83ae021","resolution":{"observed_at":"2026-06-30T00:52:40.514062Z","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-06-30T00:52:40.514062Z","title":"D’Atri and M","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2606.28599","last_updated":"2026-06-26T20:48:19Z","snapshot_observed_at":"2026-07-07T00:02:38.226622Z","submitted_at":"2026-06-26T20:48:19Z","title":"Algorithms for the Maximum Edge Open Packing Problem","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-30T00:52:40.514062Z"},"links":{"citing_paper":"/paper/2606.28599"},"observation_digest":"sha256:2d9c6d2c93eb2bffcff41bcc49be7e60fb1ec951c318d3160001bd9f70902c1f","observation_id":"f0d639ac-d035-4c36-a842-93b1d818aa16","resolution":{"observed_at":"2026-06-30T00:52:40.514062Z","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-06-30T00:52:40.514062Z","title":null,"venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2606.28599","last_updated":"2026-06-26T20:48:19Z","snapshot_observed_at":"2026-07-07T00:02:38.226622Z","submitted_at":"2026-06-26T20:48:19Z","title":"Algorithms for the Maximum Edge Open Packing Problem","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-30T00:52:40.514062Z"},"links":{"citing_paper":"/paper/2606.28599"},"observation_digest":"sha256:e5e924fdc6b84b386b375b99a172f7c60bb6b76e90958f5237cadd5b16ebf636","observation_id":"fcda392d-20c9-46dc-8c58-0f5236d2a0f8","resolution":{"observed_at":"2026-06-30T00:52:40.514062Z","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-06-30T00:52:40.514062Z","title":"Heggernes and D","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.28599","last_updated":"2026-06-26T20:48:19Z","snapshot_observed_at":"2026-07-07T00:02:38.226622Z","submitted_at":"2026-06-26T20:48:19Z","title":"Algorithms for the Maximum Edge Open Packing Problem","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-30T00:52:40.514062Z"},"links":{"citing_paper":"/paper/2606.28599"},"observation_digest":"sha256:8b1ce0894ef0810b17ea3f5b06a4dc97b2afb8503bfd32b3b31b020109050cbc","observation_id":"8b8674ff-a9e1-403a-a12b-b6a57001041a","resolution":{"observed_at":"2026-06-30T00:52:40.514062Z","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-06-30T00:52:40.514062Z","title":null,"venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2606.28599","last_updated":"2026-06-26T20:48:19Z","snapshot_observed_at":"2026-07-07T00:02:38.226622Z","submitted_at":"2026-06-26T20:48:19Z","title":"Algorithms for the Maximum Edge Open Packing Problem","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-30T00:52:40.514062Z"},"links":{"citing_paper":"/paper/2606.28599"},"observation_digest":"sha256:8cc2471fbc114cb01cda1d7101753b08d1e590e0853074dcdca3fcac4375c1ef","observation_id":"b9d5a760-5b00-4054-aa8e-f2dbac2fc413","resolution":{"observed_at":"2026-06-30T00:52:40.514062Z","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-06-30T00:52:40.514062Z","title":"Hsieh, C.-W","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.28599","last_updated":"2026-06-26T20:48:19Z","snapshot_observed_at":"2026-07-07T00:02:38.226622Z","submitted_at":"2026-06-26T20:48:19Z","title":"Algorithms for the Maximum Edge Open Packing Problem","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-30T00:52:40.514062Z"},"links":{"citing_paper":"/paper/2606.28599"},"observation_digest":"sha256:9f77081f9a601376fefadc02ff71381e3667771d5817253e92b168893baea5df","observation_id":"8a52c40a-1574-412b-9a0e-766485914fb4","resolution":{"observed_at":"2026-06-30T00:52:40.514062Z","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-06-30T00:52:40.514062Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.28599","last_updated":"2026-06-26T20:48:19Z","snapshot_observed_at":"2026-07-07T00:02:38.226622Z","submitted_at":"2026-06-26T20:48:19Z","title":"Algorithms for the Maximum Edge Open Packing Problem","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-30T00:52:40.514062Z"},"links":{"citing_paper":"/paper/2606.28599"},"observation_digest":"sha256:5a8b40ff5b3bc0995d6a561d162d3a87fc1457a7ed905ee01812908edf84bc64","observation_id":"9f847028-d70f-4883-92bf-39a2a93682db","resolution":{"observed_at":"2026-06-30T00:52:40.514062Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.01935","last_updated":"2025-08-03T22:11:41Z","snapshot_observed_at":"2026-08-06T05:21:56.531782Z","submitted_at":"2025-08-03T22:11:41Z","title":"Edge open packing: further characterizations","version":1},"cited_work":{"arxiv_id":"2508.01935","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.01935","snapshot_observed_at":"2026-07-01T16:05:49.790749Z","title":"Pandey and K","venue":null,"work_id":"5f2d95e2-16b7-454c-acc5-fdb246d3b333","year":2025},"citing_paper":{"arxiv_id":"2606.28599","last_updated":"2026-06-26T20:48:19Z","snapshot_observed_at":"2026-07-07T00:02:38.226622Z","submitted_at":"2026-06-26T20:48:19Z","title":"Algorithms for the Maximum Edge Open Packing Problem","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-30T00:52:40.514062Z"},"links":{"cited_paper":"/paper/2508.01935","citing_paper":"/paper/2606.28599"},"observation_digest":"sha256:f5fe603ed9dbb53336d0e4426082039c715aa637e2256263216615d3f2109c3f","observation_id":"2952a40b-acc1-4b11-8358-06cfab1bd56d","resolution":{"observed_at":"2026-07-01T16:05:49.792304Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2510.16236","last_updated":"2026-07-29T11:46:03Z","snapshot_observed_at":"2026-08-04T09:23:36.294987Z","submitted_at":"2025-10-17T21:56:17Z","title":"Edge open packing on subclasses of chordal graphs","version":3},"cited_work":{"arxiv_id":"2510.16236","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2510.16236","snapshot_observed_at":"2026-07-30T02:04:24.444620Z","title":null,"venue":null,"work_id":"daccbf67-190f-42d7-94a2-a7bd33138c66","year":2025},"citing_paper":{"arxiv_id":"2606.28599","last_updated":"2026-06-26T20:48:19Z","snapshot_observed_at":"2026-07-07T00:02:38.226622Z","submitted_at":"2026-06-26T20:48:19Z","title":"Algorithms for the Maximum Edge Open Packing Problem","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-30T00:52:40.514062Z"},"links":{"cited_paper":"/paper/2510.16236","citing_paper":"/paper/2606.28599"},"observation_digest":"sha256:72d7ca6ba5e6fa380a75794683c3aa049f6b4ebc0b457305790bc5e738a14f88","observation_id":"4a2eb965-07c1-4faa-9381-4ebaa4162cb2","resolution":{"observed_at":"2026-07-30T02:04:24.444620Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-30T00:52:40.514062Z","title":null,"venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2606.28599","last_updated":"2026-06-26T20:48:19Z","snapshot_observed_at":"2026-07-07T00:02:38.226622Z","submitted_at":"2026-06-26T20:48:19Z","title":"Algorithms for the Maximum Edge Open Packing Problem","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-30T00:52:40.514062Z"},"links":{"citing_paper":"/paper/2606.28599"},"observation_digest":"sha256:ab3838de2bc628357fc129c28d3b0e0ccd748c8c3818373759b9bcc1ec255d20","observation_id":"2fc869c6-ecda-4fe1-8acd-25abfe8e0c6e","resolution":{"observed_at":"2026-06-30T00:52:40.514062Z","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-06-30T00:52:40.514062Z","title":"Yeh and G","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2606.28599","last_updated":"2026-06-26T20:48:19Z","snapshot_observed_at":"2026-07-07T00:02:38.226622Z","submitted_at":"2026-06-26T20:48:19Z","title":"Algorithms for the Maximum Edge Open Packing Problem","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-30T00:52:40.514062Z"},"links":{"citing_paper":"/paper/2606.28599"},"observation_digest":"sha256:5a849ab348adac5e70c0a7e5e2ac5cefe991f14c985a71dd48717a468c351d33","observation_id":"6f32bd6d-b3ca-4666-a11f-36b62600a454","resolution":{"observed_at":"2026-06-30T00:52:40.514062Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.28599","last_updated":"2026-06-26T20:48:19Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-07-07T00:02:38.226622Z","submitted_at":"2026-06-26T20:48:19Z","title":"Algorithms for the Maximum Edge Open Packing Problem"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":20},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2606.28599."}