{"as_of":"2026-08-10T21:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7f92946f092d900e15e83bace2721aa1688f2657efe12c7881d6719914e7ef56","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T05:40:27.214492Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2607.08935/citation-record","integrity":"/paper/2607.08935/integrity","json":"/paper/2607.08935/citation-record.json","paper":"/paper/2607.08935"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:40:27.214492Z","title":"Aliev, G","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:4244d1f380b594f6309f053e13c02e3652bc78debf97f0ce05daf3cdbc821e08","observation_id":"54045de9-bf7a-49a4-9148-6ba19c3655b6","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Aliev, J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:d7c747eaa4483e8df769cf6644b1d4d6fea1781ef209c0a0d5c3dd7f25301287","observation_id":"d828b674-e53f-4fb3-b300-38ed03dc121f","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Aliev, M","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:edc9c88c76b6c512cc2d769f0b2c9b95504d922b54cbecf5fb91d942b766de0d","observation_id":"996cd08f-a7d5-4753-a6ea-0e7d3ffa6af6","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Aliev, J","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:665418eef3b9e6e450bd89712489c58283796159b7b0ab9bfc7de9f905703489","observation_id":"56411522-dcfa-4d10-b78f-877003c61287","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Integerprogramswithnearlytotallyunimodularmatrices: thecographic case","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:ebe36da807c0effe4d053bc6fe6c9c0455eb2dcef7cd4c51f1176a92ee632ac6","observation_id":"d2ea5921-0520-42f3-a185-8fb81a464d36","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Anoteonnon-degenerateintegerprogramswithsmallsub-determinants","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:27d6121675d1ce3f8e543acf0bf9794604f4198b9179fb2e6b4f1651e92801f3","observation_id":"98874e59-9642-4fcb-ba92-16e6d22520e0","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Artmann, R","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:549b9aa8f6e9dd5e8b488a9d2346e770d088d33640498b15018beb95ccdb948f","observation_id":"f9ef7a44-bdc0-4d1e-916b-6ac818614338","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Averkov and M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:86ac8b8f8f07c6197995194c38cd73e746bb4e63d3cf4f2df33bfc79ddbb9b2b","observation_id":"827efec3-0827-451e-8e7c-45773c86ce4c","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Cam- bridge University Press, Cambridge, 2nd edition, 1999","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:a1eace5afea708fa2ba3f317dcfa205f75fcabe0d9b142f28303972b4934e57f","observation_id":"4478bbe3-18df-4128-b507-39bcfe611e4b","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Bonifas, M","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:982351a7dad837c92e40705436400f04aa2bba4c84a077db511fc91307c1df07","observation_id":"bb740858-a103-4a38-b6d8-4b4c877e2b42","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Celaya, S","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:6501c0e77c246e99dc3cef9f1d5bf6a3c84a41fe5bd3843aee7b10fcba296e3d","observation_id":"325f2a43-971a-43e7-956a-eea9c0a99819","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Celaya, S","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:ead3d7ce4b593ee082765de5f98626e5c92000adaeedf50d1f0c78492f24d9fa","observation_id":"847b8325-356c-4d06-b7f9-19fe8851482b","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:b99bcf8a768d39b702f958c78162743136ebfd31139719447ff99025ec644fd1","observation_id":"ef130d5f-055e-4187-bcbd-4b7ea277ee85","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":null,"venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:0db5515477fdf7ebd0afb154762cf31910f94e5dbfde0f1b2bf98dcfbffdf26b","observation_id":"d4bb562c-5dcf-42e3-86a3-94d34ffcafaa","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Onpadberg’sconjectureaboutalmosttotally unimodular matrices.Operations Research Letters, 27(3):97–99, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:9fc7d8314fbb2678bfc09c9b7853f65a3e8edc01d6b17fd09ac91185a7fe1cd9","observation_id":"5bfc3bfb-19c1-422b-a480-6ddbf3911d7e","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Dadush and N","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:d97ef93303d685c8e18d3dc369840a0ab0458dd86fd5b86290e3223fa7c47650","observation_id":"45703798-cd24-41b4-96e6-28b779f6cc65","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Integerprogramswithbounded subdeterminants and two nonzeros per row.Journal of the ACM, 72(1), 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:b051fc952e06d3f1d16a902b83a2ce910186f9bfee9aced896447632c158eb09","observation_id":"96ed65ca-8f98-434e-b767-3ced59d022d7","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Geelen, P","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:ec7ad2ff758fb64b3bf2bab42931109c968e03c30827fb40cfe784bc82a65d4b","observation_id":"4520acb6-26fe-449f-a77b-b8a664fe597f","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Glanzer, I","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:fec0a7c3ee61afea3ad8623facfa0cd8b49e0b5bcbe0e23431858edb45f6b24b","observation_id":"e7b81775-8560-49fa-8e45-a6b1ffee167e","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Gribanov, I","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:85834653bb0d08f6abe167a5507b4e4f48fc95d3ccea22a16d889e79ce716358","observation_id":"c78d7177-f43c-451d-9ed3-68acdd007ef5","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Integralboundarypointsofconvexpolyhedra","venue":null,"work_id":null,"year":1956},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:70d305d45f5d8f0f4988d5170f900537c1e6bdb5afd81f718c72fbc5a84e9580","observation_id":"72a6448c-7a3a-419d-a4f3-a40d33bbb016","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:a858a010b87d59f55c33e431b8acc403e5394cdd7fbc122ed0519ae8df362a86","observation_id":"a9589c53-7020-406c-9ff6-b4faaa2063f4","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"InSantanuS.Dey,MarcoDiSumma, and Domenico Salvagnin, editors,Integer Programming and Combinatorial Opti- mization, pages 188–203","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:4627ec0ccae57b06d3ae1bdc8911bbb2a9cebae3f7e8d725eebbe9a9609b25e9","observation_id":"5d1f04f2-0012-4640-8744-72c2e0e38d62","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Lang.Algebra","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:99625f09d1a482a64014daf31c3df34ac74fee46d93e5fd540490ea032895a34","observation_id":"8c4917d7-6e24-4dbb-8022-505cd215e5ad","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:1d23e58d1940b278075632b83ec2c7110bbb9a98651759c9a1120690195294a1","observation_id":"3a3e65ae-6c77-42fd-8c80-12a6318260b7","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Nägele, C","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:29c9e1f5f4ea9127ca6137c9419d24b3be4f1f4f3e3066594b30c9e971db3e8d","observation_id":"33e28455-3c11-4712-a770-19d0ef46ac73","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Nägele, R","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:9f8c5e4e1d59d168817d60de4d0de8362a74e679f7a83cf5a123f6941a1b0df5","observation_id":"75c99db2-a6df-4387-b768-dd602281bbfa","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Narayanan, R","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:2dc76c4669f5c17a91380702946b33fa64ef2b21ddc501876d0626aad2fb8421","observation_id":"ec19960f-2a75-46ea-b62f-b242bb7c3e7c","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Oxley.Matroid Theory","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:809ed5f76045ce01615817267ec493533d0616094cc0c25df31ea750885e2173","observation_id":"494d73df-9a6d-429e-ab22-c1583325f3e8","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Oxley and Z","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:c03685e79d07859c77781c92372241bce9699eb72959d2076cab6a72e1d9f3ff","observation_id":"ed891ad7-a44f-4df2-9c04-a4b4440d8f87","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Onthecolumnnumberandforbid- den submatrices for∆-modular matrices.SIAM Journal on Discrete Mathemat- ics, 38(1):1–18, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:610b37fb31e557a6f3c6a6fdf023d85bc0ae62a6657beb5a010e263b0043bc84","observation_id":"c325a326-24db-4f02-b4f6-8fbcfa961212","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"math/0609764","last_updated":"2006-09-27T16:18:24Z","snapshot_observed_at":"2026-08-08T16:25:20.042013Z","submitted_at":"2006-09-27T16:18:24Z","title":"Total positivity, Grassmannians, and networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"math/0609764","snapshot_observed_at":"2026-07-13T05:40:27.214492Z","title":"Totalpositivity,Grassmannians,andnetworks.https://arxiv","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"cited_paper":"/paper/math/0609764","citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:f307ae73bf9703ae91db8aa1e8cd937273b15e49f7485829b8414e6fd8f127a4","observation_id":"8e3871f3-d5f9-4337-97b6-09ff09142374","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Graphminors.XX.Wagner’sconjecture.Jour- nal of Combinatorial Theory, Series B, 92(2):325–357, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:8c9827e7691ed00019ae08ab9093afde1cd56dc241e25128bd4fab05b68f800d","observation_id":"eb5548b1-3c8e-4003-a079-a8df06b4ae23","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Schrijver.Theory of Linear and Integer Programming","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:d99ea233ffb65cdb222912f41a61c286f969179e66782a2a5d746f8551cb9ac7","observation_id":"53ce0756-0740-4b38-a8cc-aea2650986bb","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":"Decomposition of regular matroids.Journal of Combinatorial Theory, Series B, 28(3):305–359, 1980","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:442f00076d404b2334d8faacb2eb71c884f3408c561444cfbbb9b35db3296a01","observation_id":"3bd7021f-0d9e-4a94-942f-c1d2f2737f2f","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:03565d9091e2d58eb56308489e8f34cca0a90ff3a604248c12c5416dd5fa15dd","observation_id":"58fef140-0707-489f-b9da-a3fc71c992a2","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","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-07-13T05:40:27.214492Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-13T05:40:27.214492Z"},"links":{"citing_paper":"/paper/2607.08935"},"observation_digest":"sha256:0dd913c0c26edafa42328652606f55975e27791ba6c88c5fd714ad74f02a00f6","observation_id":"ec6510ba-2020-4e6e-ae45-5f401f062e23","resolution":{"observed_at":"2026-07-13T05:40:27.214492Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.08935","last_updated":"2026-07-09T21:04:21Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T21:56:18.398758Z","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":37,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":37},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2607.08935."}