{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:42PPEU2BM2WBXQHRWK3S5XHZLJ","short_pith_number":"pith:42PPEU2B","schema_version":"1.0","canonical_sha256":"e69ef2534166ac1bc0f1b2b72edcf95a60b9c88e3dc3dd1754b38865842ebdb1","source":{"kind":"arxiv","id":"1806.03397","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.03397","created_at":"2026-05-18T00:10:10.057938+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.03397v2","created_at":"2026-05-18T00:10:10.057938+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03397","created_at":"2026-05-18T00:10:10.057938+00:00"},{"alias_kind":"pith_short_12","alias_value":"42PPEU2BM2WB","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"42PPEU2BM2WBXQHR","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"42PPEU2B","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/42PPEU2BM2WBXQHRWK3S5XHZLJ","json":"https://pith.science/pith/42PPEU2BM2WBXQHRWK3S5XHZLJ.json","graph_json":"https://pith.science/api/pith-number/42PPEU2BM2WBXQHRWK3S5XHZLJ/graph.json","events_json":"https://pith.science/api/pith-number/42PPEU2BM2WBXQHRWK3S5XHZLJ/events.json","paper":"https://pith.science/paper/42PPEU2B"},"agent_actions":{"view_html":"https://pith.science/pith/42PPEU2BM2WBXQHRWK3S5XHZLJ","download_json":"https://pith.science/pith/42PPEU2BM2WBXQHRWK3S5XHZLJ.json","view_paper":"https://pith.science/paper/42PPEU2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.03397&json=true","fetch_graph":"https://pith.science/api/pith-number/42PPEU2BM2WBXQHRWK3S5XHZLJ/graph.json","fetch_events":"https://pith.science/api/pith-number/42PPEU2BM2WBXQHRWK3S5XHZLJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42PPEU2BM2WBXQHRWK3S5XHZLJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42PPEU2BM2WBXQHRWK3S5XHZLJ/action/storage_attestation","attest_author":"https://pith.science/pith/42PPEU2BM2WBXQHRWK3S5XHZLJ/action/author_attestation","sign_citation":"https://pith.science/pith/42PPEU2BM2WBXQHRWK3S5XHZLJ/action/citation_signature","submit_replication":"https://pith.science/pith/42PPEU2BM2WBXQHRWK3S5XHZLJ/action/replication_record"}},"created_at":"2026-05-18T00:10:10.057938+00:00","updated_at":"2026-05-18T00:10:10.057938+00:00"}