{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:42PPEU2BM2WBXQHRWK3S5XHZLJ","short_pith_number":"pith:42PPEU2B","canonical_record":{"source":{"id":"1806.03397","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-09T02:30:22Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7f6f3e675bb35a5139a51d0c6409ce84e2c396982dd7cbb54483f5af0ef51998","abstract_canon_sha256":"73599bebd0aba9a6503614b9cb375a30ced0ceb009f0f05627203560ec045eb4"},"schema_version":"1.0"},"canonical_sha256":"e69ef2534166ac1bc0f1b2b72edcf95a60b9c88e3dc3dd1754b38865842ebdb1","source":{"kind":"arxiv","id":"1806.03397","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03397","created_at":"2026-05-18T00:10:10Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03397v2","created_at":"2026-05-18T00:10:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03397","created_at":"2026-05-18T00:10:10Z"},{"alias_kind":"pith_short_12","alias_value":"42PPEU2BM2WB","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"42PPEU2BM2WBXQHR","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"42PPEU2B","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:42PPEU2BM2WBXQHRWK3S5XHZLJ","target":"record","payload":{"canonical_record":{"source":{"id":"1806.03397","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-09T02:30:22Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7f6f3e675bb35a5139a51d0c6409ce84e2c396982dd7cbb54483f5af0ef51998","abstract_canon_sha256":"73599bebd0aba9a6503614b9cb375a30ced0ceb009f0f05627203560ec045eb4"},"schema_version":"1.0"},"canonical_sha256":"e69ef2534166ac1bc0f1b2b72edcf95a60b9c88e3dc3dd1754b38865842ebdb1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:10.058382Z","signature_b64":"xPohk7Ri2oc0Q0jSuN4snTkS721cnjqZ6PgnXGGPDiZ/sFkg0DflOgQHgqXHjt2H7LqCOttluL2YupGbrF1hCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e69ef2534166ac1bc0f1b2b72edcf95a60b9c88e3dc3dd1754b38865842ebdb1","last_reissued_at":"2026-05-18T00:10:10.057852Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:10.057852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.03397","source_version":2,"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:10:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q/pyWC7ZoHoIAGouhSyM0u7v2UAGw9FMMtAobqDQke4wSQzJq0QKPBIdnQB6GaWUK3fJNXcD80028T8AQm5kAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:32:22.693829Z"},"content_sha256":"b35369f8d2baf7fc6074b48e1aa9032bd9ef7853175e63b1839fb1208124b17e","schema_version":"1.0","event_id":"sha256:b35369f8d2baf7fc6074b48e1aa9032bd9ef7853175e63b1839fb1208124b17e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:42PPEU2BM2WBXQHRWK3S5XHZLJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The diameter of the fractional matching polytope and its hardness implications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Laura Sanit\\`a","submitted_at":"2018-06-09T02:30:22Z","abstract_excerpt":"The (combinatorial) diameter of a polytope $P \\subseteq \\mathbb R^d$ is the maximum value of a shortest path between a pair of vertices on the 1-skeleton of $P$, that is the graph where the nodes are given by the $0$-dimensional faces of $P$, and the edges are given the 1-dimensional faces of $P$. The diameter of a polytope has been studied from many different perspectives, including a computational complexity point of view. In particular, [Frieze and Teng, 1994] showed that computing the diameter of a polytope is (weakly) NP-hard.\n  In this paper, we show that the problem of computing the dia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03397","kind":"arxiv","version":2},"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:10:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a17A92OZRhFam3UrULM1xfMa4vAQfJFk3EtLsx2L8EMv62zrU2c4r2VUuHt0LOm2b/xUqpNbFPm09vpTNZX2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:32:22.694396Z"},"content_sha256":"66ff083bd5b90577a36261385abc9963b41ea7d14502856f2e1cbb84a60e3d42","schema_version":"1.0","event_id":"sha256:66ff083bd5b90577a36261385abc9963b41ea7d14502856f2e1cbb84a60e3d42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/42PPEU2BM2WBXQHRWK3S5XHZLJ/bundle.json","state_url":"https://pith.science/pith/42PPEU2BM2WBXQHRWK3S5XHZLJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/42PPEU2BM2WBXQHRWK3S5XHZLJ/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-05-27T06:32:22Z","links":{"resolver":"https://pith.science/pith/42PPEU2BM2WBXQHRWK3S5XHZLJ","bundle":"https://pith.science/pith/42PPEU2BM2WBXQHRWK3S5XHZLJ/bundle.json","state":"https://pith.science/pith/42PPEU2BM2WBXQHRWK3S5XHZLJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/42PPEU2BM2WBXQHRWK3S5XHZLJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:42PPEU2BM2WBXQHRWK3S5XHZLJ","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":"73599bebd0aba9a6503614b9cb375a30ced0ceb009f0f05627203560ec045eb4","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-09T02:30:22Z","title_canon_sha256":"7f6f3e675bb35a5139a51d0c6409ce84e2c396982dd7cbb54483f5af0ef51998"},"schema_version":"1.0","source":{"id":"1806.03397","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03397","created_at":"2026-05-18T00:10:10Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03397v2","created_at":"2026-05-18T00:10:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03397","created_at":"2026-05-18T00:10:10Z"},{"alias_kind":"pith_short_12","alias_value":"42PPEU2BM2WB","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"42PPEU2BM2WBXQHR","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"42PPEU2B","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:66ff083bd5b90577a36261385abc9963b41ea7d14502856f2e1cbb84a60e3d42","target":"graph","created_at":"2026-05-18T00:10:10Z","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 \\subseteq \\mathbb R^d$ is the maximum value of a shortest path between a pair of vertices on the 1-skeleton of $P$, that is the graph where the nodes are given by the $0$-dimensional faces of $P$, and the edges are given the 1-dimensional faces of $P$. The diameter of a polytope has been studied from many different perspectives, including a computational complexity point of view. In particular, [Frieze and Teng, 1994] showed that computing the diameter of a polytope is (weakly) NP-hard.\n  In this paper, we show that the problem of computing the dia","authors_text":"Laura Sanit\\`a","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-09T02:30:22Z","title":"The diameter of the fractional matching polytope and its hardness implications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03397","kind":"arxiv","version":2},"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:b35369f8d2baf7fc6074b48e1aa9032bd9ef7853175e63b1839fb1208124b17e","target":"record","created_at":"2026-05-18T00:10:10Z","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":"73599bebd0aba9a6503614b9cb375a30ced0ceb009f0f05627203560ec045eb4","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-09T02:30:22Z","title_canon_sha256":"7f6f3e675bb35a5139a51d0c6409ce84e2c396982dd7cbb54483f5af0ef51998"},"schema_version":"1.0","source":{"id":"1806.03397","kind":"arxiv","version":2}},"canonical_sha256":"e69ef2534166ac1bc0f1b2b72edcf95a60b9c88e3dc3dd1754b38865842ebdb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e69ef2534166ac1bc0f1b2b72edcf95a60b9c88e3dc3dd1754b38865842ebdb1","first_computed_at":"2026-05-18T00:10:10.057852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:10.057852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xPohk7Ri2oc0Q0jSuN4snTkS721cnjqZ6PgnXGGPDiZ/sFkg0DflOgQHgqXHjt2H7LqCOttluL2YupGbrF1hCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:10.058382Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.03397","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b35369f8d2baf7fc6074b48e1aa9032bd9ef7853175e63b1839fb1208124b17e","sha256:66ff083bd5b90577a36261385abc9963b41ea7d14502856f2e1cbb84a60e3d42"],"state_sha256":"e437b2ac57af8a3059fe20ebcc8ce4ded419a1b63dd47adbc846a140af0bb953"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yOU8Tnn8bJcdeEgF4xN4yVAbrbA+oA6MRp++TFbxkWfU9YuYtDRphZGbJEqokIk2gcT+2gBPTiKQ0SHZaZIfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:32:22.697858Z","bundle_sha256":"c24880da5e227ee509474661fd0f9407d7144538a987256b267fb3380c1086e6"}}