{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZCNLN6WONYQAUD72TQJSO2QMOE","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":"8cd6ffb476ba72b49bff2f1b5fa944e4cdfbdd9bc4333279697db52c625d2da0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-16T01:01:39Z","title_canon_sha256":"7300e94dbfd7e07e77dc49de6edef3c46684d7963c7a67c1c5042fefb07b2f84"},"schema_version":"1.0","source":{"id":"1308.3530","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3530","created_at":"2026-05-18T00:07:44Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3530v4","created_at":"2026-05-18T00:07:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3530","created_at":"2026-05-18T00:07:44Z"},{"alias_kind":"pith_short_12","alias_value":"ZCNLN6WONYQA","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZCNLN6WONYQAUD72","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZCNLN6WO","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:9e181b841cc2fcd2efd157be6eabd063939b0b2b60fd6235f9e202bf11e869d7","target":"graph","created_at":"2026-05-18T00:07:44Z","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":"Let $d \\geq 3$ be an integer. It is known that the number of edges of the edge polytope of the complete graph with $d$ vertices is $d(d-1)(d-2)/2$. In this paper, we study the maximum possible number $\\mu_d$ of edges of the edge polytope arising from finite simple graphs with $d$ vertices. We show that $\\mu_{d}=d(d-1)(d-2)/2$ if and only if $3 \\leq d \\leq 14$. In addition, we study the asymptotic behavior of $\\mu_d$. Tran--Ziegler gave a lower bound for $\\mu_d$ by constructing a random graph. We succeeded in improving this bound by constructing both a non-random graph and a random graph whose ","authors_text":"Akihiro Shikama, Aki Mori, Hidefumi Ohsugi, Takayuki Hibi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-16T01:01:39Z","title":"The number of edges of the edge polytope of a finite simple graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3530","kind":"arxiv","version":4},"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:8cf02bab63117fc031cdca05be066d552b5f2b17835df70dfe6c4ca36ad83fe1","target":"record","created_at":"2026-05-18T00:07:44Z","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":"8cd6ffb476ba72b49bff2f1b5fa944e4cdfbdd9bc4333279697db52c625d2da0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-16T01:01:39Z","title_canon_sha256":"7300e94dbfd7e07e77dc49de6edef3c46684d7963c7a67c1c5042fefb07b2f84"},"schema_version":"1.0","source":{"id":"1308.3530","kind":"arxiv","version":4}},"canonical_sha256":"c89ab6face6e200a0ffa9c13276a0c7117dafc264611103159fb85badd75e9cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c89ab6face6e200a0ffa9c13276a0c7117dafc264611103159fb85badd75e9cd","first_computed_at":"2026-05-18T00:07:44.203118Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:44.203118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5ePO+EVVrdE61hMHlmBHHXdP9LNxr1547seqws70a3GMY3ehq51kN56FPCe/5iKk3ZBdwyIOXYDrUYeuDeIjDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:44.203766Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3530","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8cf02bab63117fc031cdca05be066d552b5f2b17835df70dfe6c4ca36ad83fe1","sha256:9e181b841cc2fcd2efd157be6eabd063939b0b2b60fd6235f9e202bf11e869d7"],"state_sha256":"6b0fa67b31586c67247ec02528864b9b845c086c6c4d909dd59521f7752a45b7"}