{"as_of":"2026-08-08T06:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9e2685d0f4f4b548e994f260968f14d9a7387afb0f7d63084eb60a5dc3797c5c","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:55:25.059932Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2506.04452/citation-record","integrity":"/paper/2506.04452/integrity","json":"/paper/2506.04452/citation-record.json","paper":"/paper/2506.04452"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.itcs.2021.12","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:55:25.436999Z","title":"9 Olaf Beyersdorff, Leroy Chew, Judith Clymo, and Meena Mahajan","venue":null,"work_id":"9d95bd1e-7866-4f7a-bf45-dcf532cd639b","year":2021},"citing_paper":{"arxiv_id":"2506.04452","last_updated":"2025-06-04T21:14:14Z","snapshot_observed_at":"2026-08-07T10:39:34.448145Z","submitted_at":"2025-06-04T21:14:14Z","title":"An Expansion-Based Approach for Quantified Integer Programming","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T10:55:24.882064Z"},"links":{"citing_paper":"/paper/2506.04452"},"observation_digest":"sha256:8ce73224c987a8c7e6da910891f143aaee0c9b0cd99919998e569fae4f7d3353","observation_id":"e5fbf273-443d-40e4-96e5-d9340c73f32e","resolution":{"observed_at":"2026-08-07T10:55:25.446260Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:55:24.940423Z","title":"18 Leroy Chew and Marijn JH Heule","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.04452","last_updated":"2025-06-04T21:14:14Z","snapshot_observed_at":"2026-08-07T10:39:34.448145Z","submitted_at":"2025-06-04T21:14:14Z","title":"An Expansion-Based Approach for Quantified Integer Programming","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T10:55:24.940423Z"},"links":{"citing_paper":"/paper/2506.04452"},"observation_digest":"sha256:ac88277bb6e23cf35479dd4595302dced7638d8288344d95d93e82ad7b02115e","observation_id":"2ebea36e-19b8-4b44-9a05-a14d4c49279e","resolution":{"observed_at":"2026-08-07T10:55:24.940423Z","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.1007/s10817-024-09707-4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:55:25.252919Z","title":"21 Vašek Chvátal.Cutting-plane proofs and the stability number of a graph","venue":null,"work_id":"0e03f61b-fc41-450b-a7f2-c385999dd240","year":null},"citing_paper":{"arxiv_id":"2506.04452","last_updated":"2025-06-04T21:14:14Z","snapshot_observed_at":"2026-08-07T10:39:34.448145Z","submitted_at":"2025-06-04T21:14:14Z","title":"An Expansion-Based Approach for Quantified Integer Programming","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T10:55:24.961380Z"},"links":{"citing_paper":"/paper/2506.04452"},"observation_digest":"sha256:165ea26f8373bfae0aad5dbea8c8a5246c9a06afcac2bd0d613e5edce24a29cb","observation_id":"36dfba74-7305-4aa3-b0ff-b98ee6884502","resolution":{"observed_at":"2026-08-07T10:55:25.266427Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.25819/ubsi/4841","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:55:25.209172Z","title":"uni-siegen.de/handle/ubsi/1705,doi:http://dx.doi.org/10.25819/ubsi/4841","venue":null,"work_id":"ed8cfa8a-61e3-444a-b903-65bb49640e14","year":null},"citing_paper":{"arxiv_id":"2506.04452","last_updated":"2025-06-04T21:14:14Z","snapshot_observed_at":"2026-08-07T10:39:34.448145Z","submitted_at":"2025-06-04T21:14:14Z","title":"An Expansion-Based Approach for Quantified Integer Programming","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T10:55:25.000801Z"},"links":{"citing_paper":"/paper/2506.04452"},"observation_digest":"sha256:20b91a1b2277b2ac0396c55938be7024e81f5a292eeeb7e20fc6a29849ac3d10","observation_id":"c7ab33ac-2d97-4be5-b68c-13e36e3f9426","resolution":{"observed_at":"2026-08-07T10:55:25.216708Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:55:25.614524Z","title":"Quantified integer programs with polyhedral uncertainty set","venue":null,"work_id":"7ede1e3f-a538-4b4e-8d15-87652e08c75f","year":2016},"citing_paper":{"arxiv_id":"2506.04452","last_updated":"2025-06-04T21:14:14Z","snapshot_observed_at":"2026-08-07T10:39:34.448145Z","submitted_at":"2025-06-04T21:14:14Z","title":"An Expansion-Based Approach for Quantified Integer Programming","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T10:55:25.011264Z"},"links":{"citing_paper":"/paper/2506.04452"},"observation_digest":"sha256:f655ab5d12819b1a04349771106d1cfad5f67a6a796f6cee51a8f9a1639228c4","observation_id":"a97d42ce-b4f4-4ea4-bc1f-3f0baf8ca4e5","resolution":{"observed_at":"2026-08-07T10:55:25.636733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:55:25.549489Z","title":"Hartisch and L","venue":null,"work_id":"e0f2f497-4568-4717-8d20-5f1f33e95ea4","year":2019},"citing_paper":{"arxiv_id":"2506.04452","last_updated":"2025-06-04T21:14:14Z","snapshot_observed_at":"2026-08-07T10:39:34.448145Z","submitted_at":"2025-06-04T21:14:14Z","title":"An Expansion-Based Approach for Quantified Integer Programming","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T10:55:25.030624Z"},"links":{"citing_paper":"/paper/2506.04452"},"observation_digest":"sha256:0d98a8c6a473f45985d8f71dc1ad3acd3a1511c1401e10b729f0e78c0d88de7d","observation_id":"041f6989-d4e7-4196-ba0d-e83a9f1509c9","resolution":{"observed_at":"2026-08-07T10:55:25.557983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.11132","last_updated":"2022-10-20T09:49:24Z","snapshot_observed_at":"2026-07-06T14:08:06.808290Z","submitted_at":"2022-10-20T09:49:24Z","title":"A general model-and-run solver for multistage robust discrete linear optimization","version":1},"cited_work":{"arxiv_id":"2210.11132","doi":null,"metadata_source":"pith","pith_arxiv_id":"2210.11132","snapshot_observed_at":"2026-08-07T10:55:25.493698Z","title":"A general model-and-run solver for multistage robust discrete linear optimization","venue":"math.OC","work_id":"8566bc8f-1f28-4011-8d75-c342473d775d","year":2022},"citing_paper":{"arxiv_id":"2506.04452","last_updated":"2025-06-04T21:14:14Z","snapshot_observed_at":"2026-08-07T10:39:34.448145Z","submitted_at":"2025-06-04T21:14:14Z","title":"An Expansion-Based Approach for Quantified Integer Programming","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T10:55:25.038124Z"},"links":{"cited_paper":"/paper/2210.11132","citing_paper":"/paper/2506.04452"},"observation_digest":"sha256:a3730ce2b93fc50c4e7853cc65ae103bd9799aec3ca3311d1b66948b537caa36","observation_id":"55fe4b2d-93d4-4c8a-bb35-6e7eff00561c","resolution":{"observed_at":"2026-08-07T10:55:25.505010Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/aaai.v32i1.12208","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:55:25.156504Z","title":"org/index.php/AAAI/article/view/12208,doi:10.1609/aaai.v32i1.12208","venue":null,"work_id":"be8dedcb-289b-440f-8a53-b893404d49f0","year":null},"citing_paper":{"arxiv_id":"2506.04452","last_updated":"2025-06-04T21:14:14Z","snapshot_observed_at":"2026-08-07T10:39:34.448145Z","submitted_at":"2025-06-04T21:14:14Z","title":"An Expansion-Based Approach for Quantified Integer Programming","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T10:55:25.046697Z"},"links":{"citing_paper":"/paper/2506.04452"},"observation_digest":"sha256:8080b417503f5b5f6bd58532c676d79019011804f91ce694890597f8eda474b3","observation_id":"b7e62800-5f3e-4c23-b7d1-aed881afbcd4","resolution":{"observed_at":"2026-08-07T10:55:25.164848Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/aaai.v38i8.28654","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:55:25.113743Z","title":"62 Phebe Vayanos, Daniel Kuhn, and Berç Rustem","venue":null,"work_id":"9f26d02c-fd97-4514-8188-25f3c78da49e","year":null},"citing_paper":{"arxiv_id":"2506.04452","last_updated":"2025-06-04T21:14:14Z","snapshot_observed_at":"2026-08-07T10:39:34.448145Z","submitted_at":"2025-06-04T21:14:14Z","title":"An Expansion-Based Approach for Quantified Integer Programming","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T10:55:25.059932Z"},"links":{"citing_paper":"/paper/2506.04452"},"observation_digest":"sha256:00413d6bc71c88e3ff7c0b57eb7311b63f7277301619dadead110ccdede721e5","observation_id":"22c10fa0-6ab1-4fa3-ad1d-c8172d98223b","resolution":{"observed_at":"2026-08-07T10:55:25.133974Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:55:25.790943Z","title":"Understanding the relative strength of QBF CDCL solvers and QBF resolution","venue":null,"work_id":"18940c74-705d-448d-8fe7-438669d268fa","year":2021},"citing_paper":{"arxiv_id":"2506.04452","last_updated":"2025-06-04T21:14:14Z","snapshot_observed_at":"2026-08-07T10:39:34.448145Z","submitted_at":"2025-06-04T21:14:14Z","title":"An Expansion-Based Approach for Quantified Integer Programming","version":1},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-07T10:55:24.871907Z"},"links":{"citing_paper":"/paper/2506.04452"},"observation_digest":"sha256:e50fbadf377771e8059884a3af1ac174a1ca52d09c1da92ec2bf6afc1ff54458","observation_id":"e5301651-830b-4865-84bd-f751adb65d9d","resolution":{"observed_at":"2026-08-07T10:55:25.799113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:55:25.744855Z","title":"QCDCL vs QBF resolution: Further insights","venue":null,"work_id":"f25c2fcc-0862-4bda-9c05-a024f5d3a6ed","year":2023},"citing_paper":{"arxiv_id":"2506.04452","last_updated":"2025-06-04T21:14:14Z","snapshot_observed_at":"2026-08-07T10:39:34.448145Z","submitted_at":"2025-06-04T21:14:14Z","title":"An Expansion-Based Approach for Quantified Integer Programming","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-07T10:55:24.925462Z"},"links":{"citing_paper":"/paper/2506.04452"},"observation_digest":"sha256:cb4cb69ada8346b7b7b945fe44539a9556cf85f74e9899cdaa0931e187b540ee","observation_id":"ad95a576-c20e-4161-ac9b-2de8fc06066c","resolution":{"observed_at":"2026-08-07T10:55:25.756440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:55:25.587815Z","title":"Mastering uncertainty: towards robust multistage optimiza- tion with decision dependent uncertainty","venue":null,"work_id":"779ef072-a0d1-4982-bfa9-9c45afe3daa3","year":2019},"citing_paper":{"arxiv_id":"2506.04452","last_updated":"2025-06-04T21:14:14Z","snapshot_observed_at":"2026-08-07T10:39:34.448145Z","submitted_at":"2025-06-04T21:14:14Z","title":"An Expansion-Based Approach for Quantified Integer Programming","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-07T10:55:25.021444Z"},"links":{"citing_paper":"/paper/2506.04452"},"observation_digest":"sha256:e251a1d485c00f26b50b04f2eb31b32a6b1d857f978e84633abe6c9feae3e053","observation_id":"7ee9dd3c-5178-41dd-899d-e5ca5c7e4015","resolution":{"observed_at":"2026-08-07T10:55:25.595734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:55:25.660422Z","title":"Yasol: an open source solver for quantified mixed integer programs","venue":null,"work_id":"1b85d795-49e2-4abe-a9d9-f35dc4352d56","year":2017},"citing_paper":{"arxiv_id":"2506.04452","last_updated":"2025-06-04T21:14:14Z","snapshot_observed_at":"2026-08-07T10:39:34.448145Z","submitted_at":"2025-06-04T21:14:14Z","title":"An Expansion-Based Approach for Quantified Integer Programming","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-07T10:55:24.980390Z"},"links":{"citing_paper":"/paper/2506.04452"},"observation_digest":"sha256:1478b5d60f25aa7ee21e436e0b7fc1d1de9f35a6ae8c7b5ae156cd8891d66740","observation_id":"7c8718b5-acda-42ed-9984-73aab932143c","resolution":{"observed_at":"2026-08-07T10:55:25.667002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3352155","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:55:25.397327Z","title":"New resolution-based QBF calculi and their proof complexity.ACM Trans","venue":null,"work_id":"f6147943-58eb-4c9c-a343-093704561637","year":2019},"citing_paper":{"arxiv_id":"2506.04452","last_updated":"2025-06-04T21:14:14Z","snapshot_observed_at":"2026-08-07T10:39:34.448145Z","submitted_at":"2025-06-04T21:14:14Z","title":"An Expansion-Based Approach for Quantified Integer Programming","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T10:55:24.895344Z"},"links":{"citing_paper":"/paper/2506.04452"},"observation_digest":"sha256:1b753b6e6e32435870d416119424d25ff2a1615c009ad5caa9d488b126b099c8","observation_id":"2e45962e-ef70-4021-8039-0a922ee14ff0","resolution":{"observed_at":"2026-08-07T10:55:25.413265Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:55:25.703383Z","title":"On the complexity of quantified integer programming","venue":null,"work_id":"6f6005c0-5310-45c0-a367-c1b15da08536","year":2017},"citing_paper":{"arxiv_id":"2506.04452","last_updated":"2025-06-04T21:14:14Z","snapshot_observed_at":"2026-08-07T10:39:34.448145Z","submitted_at":"2025-06-04T21:14:14Z","title":"An Expansion-Based Approach for Quantified Integer Programming","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T10:55:24.947112Z"},"links":{"citing_paper":"/paper/2506.04452"},"observation_digest":"sha256:97c2a804b776b5f336b2b8a9f9a6ff628c756909dc94a2a75c9f08776d005b7c","observation_id":"103aaba6-5606-4032-9abc-36f3f9b4735d","resolution":{"observed_at":"2026-08-07T10:55:25.714358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:55:25.823374Z","title":"Hartisch and L","venue":null,"work_id":"3972a799-ffeb-44aa-abd5-c585b1e2444d","year":2019},"citing_paper":{"arxiv_id":"2506.04452","last_updated":"2025-06-04T21:14:14Z","snapshot_observed_at":"2026-08-07T10:39:34.448145Z","submitted_at":"2025-06-04T21:14:14Z","title":"An Expansion-Based Approach for Quantified Integer Programming","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T10:55:24.859864Z"},"links":{"citing_paper":"/paper/2506.04452"},"observation_digest":"sha256:6c7e565e8b2c5996419aff7d8f5ef79517221ec4cab0ebadb944eb2457cdd3eb","observation_id":"e01fe5e3-d7fb-4be6-994d-b865800fdf13","resolution":{"observed_at":"2026-08-07T10:55:25.830203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.sat.2023.4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:55:25.310941Z","title":"15 Hubie Chen","venue":null,"work_id":"6fc99bad-eda2-45a2-8a25-659f6ccbc97e","year":2023},"citing_paper":{"arxiv_id":"2506.04452","last_updated":"2025-06-04T21:14:14Z","snapshot_observed_at":"2026-08-07T10:39:34.448145Z","submitted_at":"2025-06-04T21:14:14Z","title":"An Expansion-Based Approach for Quantified Integer Programming","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T10:55:24.932950Z"},"links":{"citing_paper":"/paper/2506.04452"},"observation_digest":"sha256:2b45a776c3f3a3822db8b926451c2b06f7627c4fc0093339c86a61f4bbd59250","observation_id":"99cee6e4-3199-458f-b4ae-ab35c7acba23","resolution":{"observed_at":"2026-08-07T10:55:25.324090Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:55:24.911754Z","title":"12 Nikolaj Bjørner, Mikolás Janota, and William Klieber","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.04452","last_updated":"2025-06-04T21:14:14Z","snapshot_observed_at":"2026-08-07T10:39:34.448145Z","submitted_at":"2025-06-04T21:14:14Z","title":"An Expansion-Based Approach for Quantified Integer Programming","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T10:55:24.911754Z"},"links":{"citing_paper":"/paper/2506.04452"},"observation_digest":"sha256:64c00a381a4f8ecd1bc396efc4930d9507bef6d08cc96d6bdc53b801c3454651","observation_id":"6959c4be-e9ee-456c-8de8-af0a4d6d5009","resolution":{"observed_at":"2026-08-07T10:55:24.911754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.04452","last_updated":"2025-06-04T21:14:14Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-07T10:39:34.448145Z","submitted_at":"2025-06-04T21:14:14Z","title":"An Expansion-Based Approach for Quantified Integer Programming"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":8,"verified_fuzzy":8},"total_outbound_references":18},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2506.04452."}