{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ANTCNRXW52I7BNNYLJ67TBQJMI","short_pith_number":"pith:ANTCNRXW","schema_version":"1.0","canonical_sha256":"036626c6f6ee91f0b5b85a7df9860962379c1732bf79d76a4e106e15351cb32b","source":{"kind":"arxiv","id":"2512.16572","version":2},"attestation_state":"computed","paper":{"title":"The number of edges of a symmetric edge polytope","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Giulia Codenotti, Lorenzo Venturello, Roberto Riccardi","submitted_at":"2025-12-18T14:12:49Z","abstract_excerpt":"The symmetric edge polytope of a simple graph is a lattice polytope defined as the convex hull of a subset of the type A roots corresponding to the edges of the graph. In this article we prove a sharp lower bound for the number of edges of the symmetric edge polytope of a graph as a function of elementary graph invariants. Moreover, we characterize graphs attaining this bound. We highlight a connection with the h*-polynomial of such polytopes and, motivated by a conjecture of Ohsugi and Tsuchiya, we investigate the behaviour of such polynomial under edge-deletion in the graph."},"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":"2512.16572","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-12-18T14:12:49Z","cross_cats_sorted":[],"title_canon_sha256":"825f3e1c6c0c93db91ed141efe07545ee3f641498e8701fe315edbf4cf28bb0f","abstract_canon_sha256":"834a1403eabed3d677a5338f38279a9bc10fcd3abaaf2d74f19b96c47b20ee72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:19:43.801096Z","signature_b64":"lXmb3fQE0xFd4lq3H79gLKQbwYc0vrbd2q8yy/0rRR08HnIUTZ/RAF0Ea5Z+JIcl+iyL8I29xZzOtyCl/BidDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"036626c6f6ee91f0b5b85a7df9860962379c1732bf79d76a4e106e15351cb32b","last_reissued_at":"2026-07-07T02:19:43.800064Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:19:43.800064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The number of edges of a symmetric edge polytope","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Giulia Codenotti, Lorenzo Venturello, Roberto Riccardi","submitted_at":"2025-12-18T14:12:49Z","abstract_excerpt":"The symmetric edge polytope of a simple graph is a lattice polytope defined as the convex hull of a subset of the type A roots corresponding to the edges of the graph. In this article we prove a sharp lower bound for the number of edges of the symmetric edge polytope of a graph as a function of elementary graph invariants. Moreover, we characterize graphs attaining this bound. We highlight a connection with the h*-polynomial of such polytopes and, motivated by a conjecture of Ohsugi and Tsuchiya, we investigate the behaviour of such polynomial under edge-deletion in the graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.16572","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2512.16572/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2512.16572","created_at":"2026-07-07T02:19:43.800180+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.16572v2","created_at":"2026-07-07T02:19:43.800180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.16572","created_at":"2026-07-07T02:19:43.800180+00:00"},{"alias_kind":"pith_short_12","alias_value":"ANTCNRXW52I7","created_at":"2026-07-07T02:19:43.800180+00:00"},{"alias_kind":"pith_short_16","alias_value":"ANTCNRXW52I7BNNY","created_at":"2026-07-07T02:19:43.800180+00:00"},{"alias_kind":"pith_short_8","alias_value":"ANTCNRXW","created_at":"2026-07-07T02:19:43.800180+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.02424","citing_title":"Symmetric edge polytopes are not gamma-positive","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ANTCNRXW52I7BNNYLJ67TBQJMI","json":"https://pith.science/pith/ANTCNRXW52I7BNNYLJ67TBQJMI.json","graph_json":"https://pith.science/api/pith-number/ANTCNRXW52I7BNNYLJ67TBQJMI/graph.json","events_json":"https://pith.science/api/pith-number/ANTCNRXW52I7BNNYLJ67TBQJMI/events.json","paper":"https://pith.science/paper/ANTCNRXW"},"agent_actions":{"view_html":"https://pith.science/pith/ANTCNRXW52I7BNNYLJ67TBQJMI","download_json":"https://pith.science/pith/ANTCNRXW52I7BNNYLJ67TBQJMI.json","view_paper":"https://pith.science/paper/ANTCNRXW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.16572&json=true","fetch_graph":"https://pith.science/api/pith-number/ANTCNRXW52I7BNNYLJ67TBQJMI/graph.json","fetch_events":"https://pith.science/api/pith-number/ANTCNRXW52I7BNNYLJ67TBQJMI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ANTCNRXW52I7BNNYLJ67TBQJMI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ANTCNRXW52I7BNNYLJ67TBQJMI/action/storage_attestation","attest_author":"https://pith.science/pith/ANTCNRXW52I7BNNYLJ67TBQJMI/action/author_attestation","sign_citation":"https://pith.science/pith/ANTCNRXW52I7BNNYLJ67TBQJMI/action/citation_signature","submit_replication":"https://pith.science/pith/ANTCNRXW52I7BNNYLJ67TBQJMI/action/replication_record"}},"created_at":"2026-07-07T02:19:43.800180+00:00","updated_at":"2026-07-07T02:19:43.800180+00:00"}