{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MM6OA5AWH3RPVKXW7SG6SVRUNC","short_pith_number":"pith:MM6OA5AW","schema_version":"1.0","canonical_sha256":"633ce074163ee2faaaf6fc8de9563468bfca0ca068ceb2e735eb6a43a3c98006","source":{"kind":"arxiv","id":"1510.07678","version":1},"attestation_state":"computed","paper":{"title":"Hirsch polytopes with exponentially long combinatorial segments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Francisco Santos, Jean-Philippe Labb\\'e, Thibault Manneville","submitted_at":"2015-10-26T20:55:06Z","abstract_excerpt":"In their paper proving the Hirsch bound for flag normal simplicial complexes (Math. Oper.~Res.~2014) Adiprasito and Benedetti define the notion of~\\emph{combinatorial segment}. The study of the maximal length of these objects provides the upper bound~$O(n2^d)$ for the diameter of any normal pure simplicial complex of dimension~$d$ with~$n$ vertices, and the Hirsch bound $n-d$ if the complexes are, moreover, flag. In the present article, we propose a formulation of combinatorial segments which is equivalent but more local, by introducing the notions of monotonicity and conservativeness of dual "},"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":"1510.07678","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-26T20:55:06Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"38da7e5f4bb77e6c5c1e089f70adcb083e8e20d04b0b22c33a356cb94bcbdbe2","abstract_canon_sha256":"e46aa7c34619c7b4e0bfa0ceb78eebcdcf53a7d330b01526d091da60e858bb20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:32.714594Z","signature_b64":"BTlxTK3utlQ7V+53/Ps+7M5Rrb6lkLzIdL5wWZ9kJGMVUk4Mx4erv7JaIBH7ohwOFhMJ+m3/31Tw/hI8QhZlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"633ce074163ee2faaaf6fc8de9563468bfca0ca068ceb2e735eb6a43a3c98006","last_reissued_at":"2026-05-18T00:33:32.713905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:32.713905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hirsch polytopes with exponentially long combinatorial segments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Francisco Santos, Jean-Philippe Labb\\'e, Thibault Manneville","submitted_at":"2015-10-26T20:55:06Z","abstract_excerpt":"In their paper proving the Hirsch bound for flag normal simplicial complexes (Math. Oper.~Res.~2014) Adiprasito and Benedetti define the notion of~\\emph{combinatorial segment}. The study of the maximal length of these objects provides the upper bound~$O(n2^d)$ for the diameter of any normal pure simplicial complex of dimension~$d$ with~$n$ vertices, and the Hirsch bound $n-d$ if the complexes are, moreover, flag. In the present article, we propose a formulation of combinatorial segments which is equivalent but more local, by introducing the notions of monotonicity and conservativeness of dual "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07678","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.07678","created_at":"2026-05-18T00:33:32.714018+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.07678v1","created_at":"2026-05-18T00:33:32.714018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07678","created_at":"2026-05-18T00:33:32.714018+00:00"},{"alias_kind":"pith_short_12","alias_value":"MM6OA5AWH3RP","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MM6OA5AWH3RPVKXW","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MM6OA5AW","created_at":"2026-05-18T12:29:32.376354+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/MM6OA5AWH3RPVKXW7SG6SVRUNC","json":"https://pith.science/pith/MM6OA5AWH3RPVKXW7SG6SVRUNC.json","graph_json":"https://pith.science/api/pith-number/MM6OA5AWH3RPVKXW7SG6SVRUNC/graph.json","events_json":"https://pith.science/api/pith-number/MM6OA5AWH3RPVKXW7SG6SVRUNC/events.json","paper":"https://pith.science/paper/MM6OA5AW"},"agent_actions":{"view_html":"https://pith.science/pith/MM6OA5AWH3RPVKXW7SG6SVRUNC","download_json":"https://pith.science/pith/MM6OA5AWH3RPVKXW7SG6SVRUNC.json","view_paper":"https://pith.science/paper/MM6OA5AW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.07678&json=true","fetch_graph":"https://pith.science/api/pith-number/MM6OA5AWH3RPVKXW7SG6SVRUNC/graph.json","fetch_events":"https://pith.science/api/pith-number/MM6OA5AWH3RPVKXW7SG6SVRUNC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MM6OA5AWH3RPVKXW7SG6SVRUNC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MM6OA5AWH3RPVKXW7SG6SVRUNC/action/storage_attestation","attest_author":"https://pith.science/pith/MM6OA5AWH3RPVKXW7SG6SVRUNC/action/author_attestation","sign_citation":"https://pith.science/pith/MM6OA5AWH3RPVKXW7SG6SVRUNC/action/citation_signature","submit_replication":"https://pith.science/pith/MM6OA5AWH3RPVKXW7SG6SVRUNC/action/replication_record"}},"created_at":"2026-05-18T00:33:32.714018+00:00","updated_at":"2026-05-18T00:33:32.714018+00:00"}