{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YLP6YHRT5U45B7TOVNLAEIUH2F","short_pith_number":"pith:YLP6YHRT","canonical_record":{"source":{"id":"2607.08935","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-09T21:04:21Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e5ebfcb5ea6e92537db54ba3953ce008957472cdb8f4b2a34ad6f6d51b39d906","abstract_canon_sha256":"623660f9ad5477ccac0e499a66352d12207a947d0972491ef3dce3ea1929f6f8"},"schema_version":"1.0"},"canonical_sha256":"c2dfec1e33ed39d0fe6eab56022287d150ad0c86575e2407971175e8885f015f","source":{"kind":"arxiv","id":"2607.08935","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.08935","created_at":"2026-07-13T00:17:28Z"},{"alias_kind":"arxiv_version","alias_value":"2607.08935v1","created_at":"2026-07-13T00:17:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08935","created_at":"2026-07-13T00:17:28Z"},{"alias_kind":"pith_short_12","alias_value":"YLP6YHRT5U45","created_at":"2026-07-13T00:17:28Z"},{"alias_kind":"pith_short_16","alias_value":"YLP6YHRT5U45B7TO","created_at":"2026-07-13T00:17:28Z"},{"alias_kind":"pith_short_8","alias_value":"YLP6YHRT","created_at":"2026-07-13T00:17:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YLP6YHRT5U45B7TOVNLAEIUH2F","target":"record","payload":{"canonical_record":{"source":{"id":"2607.08935","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-09T21:04:21Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e5ebfcb5ea6e92537db54ba3953ce008957472cdb8f4b2a34ad6f6d51b39d906","abstract_canon_sha256":"623660f9ad5477ccac0e499a66352d12207a947d0972491ef3dce3ea1929f6f8"},"schema_version":"1.0"},"canonical_sha256":"c2dfec1e33ed39d0fe6eab56022287d150ad0c86575e2407971175e8885f015f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-13T00:17:28.198748Z","signature_b64":"hkcrZXPXdzZ+hxTQ7+21ndfftaDRvM3iLdfEZuVqUVaRbHQaIHYZQmBAcs74KeEvzyT2Ijyq07KhgXZuLnLsAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2dfec1e33ed39d0fe6eab56022287d150ad0c86575e2407971175e8885f015f","last_reissued_at":"2026-07-13T00:17:28.197523Z","signature_status":"signed_v1","first_computed_at":"2026-07-13T00:17:28.197523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.08935","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-13T00:17:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u7sPV1aoNeKXuJxl3DZw5+oNQ1EWqKksj4nyTLRj66dSoPaaJvMvyQhiBtz1Hp6JR50pgotftlBmD0tWil/oCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:57:07.513688Z"},"content_sha256":"026a598a57e85b355e43e9c070bc472bd8b01839bb61fd5d944f0785f8dbf583","schema_version":"1.0","event_id":"sha256:026a598a57e85b355e43e9c070bc472bd8b01839bb61fd5d944f0785f8dbf583"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YLP6YHRT5U45B7TOVNLAEIUH2F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Marcel Celaya, Robert Weismantel, Stefan Kuhlmann","submitted_at":"2026-07-09T21:04:21Z","abstract_excerpt":"We introduce a framework for tackling questions in discrete optimization associated with parametric constraint matrices. More precisely, the constraint matrices have entries that are polynomials in one variable and all subdeterminants of these matrices are polynomials in a given prescribed set $S$. Two key problems arise in this context. The first is the recognition problem: can a matrix of this form be recognized in polynomial time? The second is the optimization problem: given an integer program whose constraint matrix is of this form, can it be solved in polynomial time? We answer both ques"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08935","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.08935/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-13T00:17:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d7l3DakFRDAyJzA+thqgMsqfw7OY5x84UBeJ743nCTm6UdoOZscSRv9rzDIO2custbaIGAIy5GAFWKQnbmXNAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:57:07.514197Z"},"content_sha256":"16baad3eeb27b5d312de3376d0e919a2686a8c73d9ce9ef340717fb26151d52e","schema_version":"1.0","event_id":"sha256:16baad3eeb27b5d312de3376d0e919a2686a8c73d9ce9ef340717fb26151d52e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YLP6YHRT5U45B7TOVNLAEIUH2F/bundle.json","state_url":"https://pith.science/pith/YLP6YHRT5U45B7TOVNLAEIUH2F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YLP6YHRT5U45B7TOVNLAEIUH2F/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T12:57:07Z","links":{"resolver":"https://pith.science/pith/YLP6YHRT5U45B7TOVNLAEIUH2F","bundle":"https://pith.science/pith/YLP6YHRT5U45B7TOVNLAEIUH2F/bundle.json","state":"https://pith.science/pith/YLP6YHRT5U45B7TOVNLAEIUH2F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YLP6YHRT5U45B7TOVNLAEIUH2F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YLP6YHRT5U45B7TOVNLAEIUH2F","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"623660f9ad5477ccac0e499a66352d12207a947d0972491ef3dce3ea1929f6f8","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-09T21:04:21Z","title_canon_sha256":"e5ebfcb5ea6e92537db54ba3953ce008957472cdb8f4b2a34ad6f6d51b39d906"},"schema_version":"1.0","source":{"id":"2607.08935","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.08935","created_at":"2026-07-13T00:17:28Z"},{"alias_kind":"arxiv_version","alias_value":"2607.08935v1","created_at":"2026-07-13T00:17:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08935","created_at":"2026-07-13T00:17:28Z"},{"alias_kind":"pith_short_12","alias_value":"YLP6YHRT5U45","created_at":"2026-07-13T00:17:28Z"},{"alias_kind":"pith_short_16","alias_value":"YLP6YHRT5U45B7TO","created_at":"2026-07-13T00:17:28Z"},{"alias_kind":"pith_short_8","alias_value":"YLP6YHRT","created_at":"2026-07-13T00:17:28Z"}],"graph_snapshots":[{"event_id":"sha256:16baad3eeb27b5d312de3376d0e919a2686a8c73d9ce9ef340717fb26151d52e","target":"graph","created_at":"2026-07-13T00:17:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.08935/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a framework for tackling questions in discrete optimization associated with parametric constraint matrices. More precisely, the constraint matrices have entries that are polynomials in one variable and all subdeterminants of these matrices are polynomials in a given prescribed set $S$. Two key problems arise in this context. The first is the recognition problem: can a matrix of this form be recognized in polynomial time? The second is the optimization problem: given an integer program whose constraint matrix is of this form, can it be solved in polynomial time? We answer both ques","authors_text":"Marcel Celaya, Robert Weismantel, Stefan Kuhlmann","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-09T21:04:21Z","title":"Polynomial Matrices in Integer Programming With Restricted Subdeterminants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08935","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:026a598a57e85b355e43e9c070bc472bd8b01839bb61fd5d944f0785f8dbf583","target":"record","created_at":"2026-07-13T00:17:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"623660f9ad5477ccac0e499a66352d12207a947d0972491ef3dce3ea1929f6f8","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-09T21:04:21Z","title_canon_sha256":"e5ebfcb5ea6e92537db54ba3953ce008957472cdb8f4b2a34ad6f6d51b39d906"},"schema_version":"1.0","source":{"id":"2607.08935","kind":"arxiv","version":1}},"canonical_sha256":"c2dfec1e33ed39d0fe6eab56022287d150ad0c86575e2407971175e8885f015f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2dfec1e33ed39d0fe6eab56022287d150ad0c86575e2407971175e8885f015f","first_computed_at":"2026-07-13T00:17:28.197523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-13T00:17:28.197523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hkcrZXPXdzZ+hxTQ7+21ndfftaDRvM3iLdfEZuVqUVaRbHQaIHYZQmBAcs74KeEvzyT2Ijyq07KhgXZuLnLsAg==","signature_status":"signed_v1","signed_at":"2026-07-13T00:17:28.198748Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.08935","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:026a598a57e85b355e43e9c070bc472bd8b01839bb61fd5d944f0785f8dbf583","sha256:16baad3eeb27b5d312de3376d0e919a2686a8c73d9ce9ef340717fb26151d52e"],"state_sha256":"a3e3b17b4a500732a084ceeb7ea6f02ef15574bfecbbf262ec5784a9ce9105c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KTRyiQK7UoBCDWRwjNQA6yyHVqu1y3cZ3bFsowt+4yCAcan5ykXQHNR5aU9+5Llw4MkKdJqMlMQKkTfz7qTeBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T12:57:07.517965Z","bundle_sha256":"a5fd49ca9d437ab118f7b639c8c4456465d1c99281407f4c660e4334e7c4c3aa"}}