{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PZTBVZES7V3NC4FLAQTH6N5WC7","short_pith_number":"pith:PZTBVZES","canonical_record":{"source":{"id":"1709.09642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-27T17:26:29Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ff435cca61eb8fd6d94f760af597de701996597f0b60ed7bbc9eabc586b0cc9d","abstract_canon_sha256":"dd9c23d08f8c775bd4f0d8b1ccfd959fd26b03bd920aa8989ebcc0a2e7b68c2a"},"schema_version":"1.0"},"canonical_sha256":"7e661ae492fd76d170ab04267f37b617e5988b7021993de55e93ce34c61f02e2","source":{"kind":"arxiv","id":"1709.09642","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09642","created_at":"2026-05-18T00:34:11Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09642v1","created_at":"2026-05-18T00:34:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09642","created_at":"2026-05-18T00:34:11Z"},{"alias_kind":"pith_short_12","alias_value":"PZTBVZES7V3N","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PZTBVZES7V3NC4FL","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PZTBVZES","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PZTBVZES7V3NC4FLAQTH6N5WC7","target":"record","payload":{"canonical_record":{"source":{"id":"1709.09642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-27T17:26:29Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ff435cca61eb8fd6d94f760af597de701996597f0b60ed7bbc9eabc586b0cc9d","abstract_canon_sha256":"dd9c23d08f8c775bd4f0d8b1ccfd959fd26b03bd920aa8989ebcc0a2e7b68c2a"},"schema_version":"1.0"},"canonical_sha256":"7e661ae492fd76d170ab04267f37b617e5988b7021993de55e93ce34c61f02e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:11.031786Z","signature_b64":"lsuD/q3eD0HanVg/tehUX7bY6DXQ/Z0nTLPcOMoMdH4FkROMoaZEHzkXslhNKtRz0Ed8dgNSNebGhPlK1JFRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e661ae492fd76d170ab04267f37b617e5988b7021993de55e93ce34c61f02e2","last_reissued_at":"2026-05-18T00:34:11.031193Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:11.031193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.09642","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-05-18T00:34:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"87GpUTSPYH3ir2dwRcoMt1dFMvLd9snaX6Pox4ugI+rY0SAUdH691c5XTn0VtumjOnpbBKKFYseTdijkGe29Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:07:23.313058Z"},"content_sha256":"e1e5baaf4f4519e223e6789a07b0526fd9bca6f394bf064f74c9a59be8f43860","schema_version":"1.0","event_id":"sha256:e1e5baaf4f4519e223e6789a07b0526fd9bca6f394bf064f74c9a59be8f43860"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PZTBVZES7V3NC4FLAQTH6N5WC7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Circuit Diameter of some Combinatorial Polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Kanstantsin Pashkovich, Laura Sanit\\`a, Sean Kafer","submitted_at":"2017-09-27T17:26:29Z","abstract_excerpt":"The combinatorial diameter of a polytope $P$ is the maximum value of a shortest path between two vertices of $P$, where the path uses the edges of $P$ only. In contrast to the combinatorial diameter, the circuit diameter of $P$ is defined as the maximum value of a shortest path between two vertices of $P$, where the path uses potential edge directions of $P$ i.e., all edge directions that can arise by translating some of the facets of $P$.\n  In this paper, we study the circuit diameter of polytopes corresponding to classical combinatorial optimization problems, such as the Matching polytope, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09642","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":""},"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-05-18T00:34:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oJWiu39N2BCbE03zoGLLWliDmod1vsXmEUN/DUJSIQ7rCQ/Fz9h1UEZivpEJ3Ao9KzKXXjF2p1hVKqFm1Ka2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:07:23.313714Z"},"content_sha256":"c1a447f04032df17806a826435a43d39764a8020c3c7cf1c5e77d9a63f0516c1","schema_version":"1.0","event_id":"sha256:c1a447f04032df17806a826435a43d39764a8020c3c7cf1c5e77d9a63f0516c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PZTBVZES7V3NC4FLAQTH6N5WC7/bundle.json","state_url":"https://pith.science/pith/PZTBVZES7V3NC4FLAQTH6N5WC7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PZTBVZES7V3NC4FLAQTH6N5WC7/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-06-09T12:07:23Z","links":{"resolver":"https://pith.science/pith/PZTBVZES7V3NC4FLAQTH6N5WC7","bundle":"https://pith.science/pith/PZTBVZES7V3NC4FLAQTH6N5WC7/bundle.json","state":"https://pith.science/pith/PZTBVZES7V3NC4FLAQTH6N5WC7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PZTBVZES7V3NC4FLAQTH6N5WC7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PZTBVZES7V3NC4FLAQTH6N5WC7","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":"dd9c23d08f8c775bd4f0d8b1ccfd959fd26b03bd920aa8989ebcc0a2e7b68c2a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-27T17:26:29Z","title_canon_sha256":"ff435cca61eb8fd6d94f760af597de701996597f0b60ed7bbc9eabc586b0cc9d"},"schema_version":"1.0","source":{"id":"1709.09642","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09642","created_at":"2026-05-18T00:34:11Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09642v1","created_at":"2026-05-18T00:34:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09642","created_at":"2026-05-18T00:34:11Z"},{"alias_kind":"pith_short_12","alias_value":"PZTBVZES7V3N","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PZTBVZES7V3NC4FL","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PZTBVZES","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:c1a447f04032df17806a826435a43d39764a8020c3c7cf1c5e77d9a63f0516c1","target":"graph","created_at":"2026-05-18T00:34:11Z","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"},"paper":{"abstract_excerpt":"The combinatorial diameter of a polytope $P$ is the maximum value of a shortest path between two vertices of $P$, where the path uses the edges of $P$ only. In contrast to the combinatorial diameter, the circuit diameter of $P$ is defined as the maximum value of a shortest path between two vertices of $P$, where the path uses potential edge directions of $P$ i.e., all edge directions that can arise by translating some of the facets of $P$.\n  In this paper, we study the circuit diameter of polytopes corresponding to classical combinatorial optimization problems, such as the Matching polytope, t","authors_text":"Kanstantsin Pashkovich, Laura Sanit\\`a, Sean Kafer","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-27T17:26:29Z","title":"On the Circuit Diameter of some Combinatorial Polytopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09642","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:e1e5baaf4f4519e223e6789a07b0526fd9bca6f394bf064f74c9a59be8f43860","target":"record","created_at":"2026-05-18T00:34:11Z","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":"dd9c23d08f8c775bd4f0d8b1ccfd959fd26b03bd920aa8989ebcc0a2e7b68c2a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-27T17:26:29Z","title_canon_sha256":"ff435cca61eb8fd6d94f760af597de701996597f0b60ed7bbc9eabc586b0cc9d"},"schema_version":"1.0","source":{"id":"1709.09642","kind":"arxiv","version":1}},"canonical_sha256":"7e661ae492fd76d170ab04267f37b617e5988b7021993de55e93ce34c61f02e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e661ae492fd76d170ab04267f37b617e5988b7021993de55e93ce34c61f02e2","first_computed_at":"2026-05-18T00:34:11.031193Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:11.031193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lsuD/q3eD0HanVg/tehUX7bY6DXQ/Z0nTLPcOMoMdH4FkROMoaZEHzkXslhNKtRz0Ed8dgNSNebGhPlK1JFRBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:11.031786Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.09642","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1e5baaf4f4519e223e6789a07b0526fd9bca6f394bf064f74c9a59be8f43860","sha256:c1a447f04032df17806a826435a43d39764a8020c3c7cf1c5e77d9a63f0516c1"],"state_sha256":"e63bd00ff4d7b16794ee286e90b94256d7147aeca5e5c611b5d20b6319454d0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yl9KoOGOd9DqeYw+INtvRa8XYcPZI5JYhZk2/L/C7G9HaOP/xnKuH3gprNroBKGlajrjPRh71F1yroBsB4UHBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:07:23.317513Z","bundle_sha256":"2b1c805d32edf2e13731a2c605b8d8c261fc671bcab10d183c1987ae96314fa4"}}