{"as_of":"2026-08-08T20:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f9e894041e2756ad21265c14ae4c3787c425eeb247b6722f91dca3d458c283e4","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-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/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-07T02:45:20.799037Z","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:4e0ab553ef0825da29fc4da8f7386dcaba2c52aec2fd2a2f97958364b5709cbd","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-07T02:45:20.799037Z","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:ef8eb4ace5ef85624c656530255bf7d7cc10ba0fed8ea058da84b397907b6047","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-07T02:45:20.799037Z","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:a512752c411f887ea291b9aa5fd9cd6af9c9fc6de062f04f2a1c27e9bfcbf433","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-07T02:45:20.799037Z","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:6a28070516afa515f516abe6fce88817ec2d6723e1dbfd82ba14fae242ed7a18","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-07T02:45:20.799037Z","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:b454d0848857a0cf243208c30ba2256af0e96f8dfcbf7d835e55111f8bf72f43","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-07T02:45:20.799037Z","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:7bf2c0d74a865f994aac0417000578d442b028d4cc7684e14156d94cd7665192","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-07T02:45:20.799037Z","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:3b7e8f4668d2f2633b6e4fbfdd776e66da88d6db7dbe1efda0fd7fefc142e8ee","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-07T02:45:20.799037Z","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:d9633fd8617da6f53f47fd243736ce0dd5cf4c48f519746389a77473f54a315c","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-07T02:45:20.799037Z","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:118ef9f9f93115437de952d344a6334d45bce8812112419ae248c663cdfde63b","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-07T02:45:20.799037Z","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:9c1e848519c5d486b037eaf86b161eb1d8489ad280ddcb48e621408cf5218f9a","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-07T02:45:20.799037Z","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:04c024f3cb9bfa4e8172c9c46649779ec044f75670cf6e7d5751fc1af661f61e","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-07T02:45:20.799037Z","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:dde7627a59c6d645bf2f2447ed743c2b63740fef9eaa915a36e5b99aec319ab0","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-07T02:45:20.799037Z","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:462e4474196f8111e4640ecea027d62f34678fc68ba69d4c809b870fc680b393","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-07T02:45:20.799037Z","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:7ac1f5580665b0c1df67060d1173cfa8f1144c1c209b4b6574945a7ab944c7f4","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-07T02:45:20.799037Z","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:2acca4dca4f67f5a0fa184887e37e00f1bcd4f34ba638cce551593e9c7b6b8dc","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-07T02:45:20.799037Z","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:dcfccc5ada0d9a7d36dc075628bb6b8023acc78ed218c727caec0d8ff0b9839a","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-07T02:45:20.799037Z","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:46f08125d040a28ba5a0728f3df67688c39cbc97a05a9977b00ed0c32fbcad2a","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-07T02:45:20.799037Z","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:f26000205922addc79074393383094c134162ca8b499908078b406067d07a533","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-07T02:45:20.799037Z","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:7930c2187630aa960c9ede34780bd455e09dfb32c6e27aa27165d6d38f99b96b","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-07T02:45:20.799037Z","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:a28798385427da13127e03f2dc341c3eb38adfbedab569154cfdfd50963647c3","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-07T02:45:20.799037Z","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:15dc402f82fdb38130a738a9c27b7865b0e6d586ca1e4291485354d5e7ebccdf","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-07T02:45:20.799037Z","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:c211e1ddbcae601ff9cf8e44121225e3c598593fe6dc89407ea7188abab58518","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-07T02:45:20.799037Z","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:d953f7f8f420b8891c96e6dbece0df0b9dad3e466420e40612bbe91f7eafa3a1","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-07T02:45:20.799037Z","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:fd4346a0dd4c42e468003d7d53d68e8f74d41a61b295df0e188d05ce9f5353d1","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-07T02:45:20.799037Z","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:8f285d86a0d54ca18d1849399d0e13854ccfdac491b4b6910820f0595406aa9e","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-07T02:45:20.799037Z","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:d3e29e678d9391d13853120c93e21047457fb849cc6b1ed83219a5af559f9ada","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-07T02:45:20.799037Z","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:f2b88785d02ebe6a1f4dbe4f87347612eb8301dd562ca65b056ca3f9f1bb5c12","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-07T02:45:20.799037Z","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:cd1bcced7fbaa795cccd19b28ad196854245dfe9cc1f9ddef075c318040b64dc","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-07T02:45:20.799037Z","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:2b337d48a79ea0dce15584b9f187aa057fbe251d4d2119fb7006ab5bfb5d425f","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-07T02:45:20.799037Z","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:599244351b4d18580ab3286c179b5f44382630e7e35b61b2c2b2d81b6186b8ec","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-07T02:45:20.799037Z","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:d7e2800705ec0bca5968676a472670766ec9fb30fd5d1bee0134664f36ab936b","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-07T02:45:20.799037Z","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:ffb79f2a566a845b8d5aedb7bb849a1455191c2419862cec3caa80252e286e15","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-07T02:45:20.799037Z","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:2d507c923d395f7178fbc0b0722c56d4b4c8a97f9038b928610a128a2f92a713","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-07T02:45:20.799037Z","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:6651c27203da3fe8ca3c59eed18bb0d856452d4577e71ad131576be458301b76","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-07T02:45:20.799037Z","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:d133c56bb3a1099ed452002a01f45a6ef286f199cadbb108788626d782b0a74b","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-07T02:45:20.799037Z","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:08bfe8a748960e430f92b25f112d1db7fff8b6d30408eae968eb222b77d6fbf3","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-07T02:45:20.799037Z","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:5f63edaf18c57809eca1df7e7e351f7102a5c7020ad480cd81cff4c335352a41","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-07T02:45:20.799037Z","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-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 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2607.08935."}