{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5NF5JR75OCPS3G3TA4TQSVC4EI","short_pith_number":"pith:5NF5JR75","schema_version":"1.0","canonical_sha256":"eb4bd4c7fd709f2d9b73072709545c2234b6b907625bb9382cac8e66e8e16aca","source":{"kind":"arxiv","id":"1911.05012","version":2},"attestation_state":"computed","paper":{"title":"Persistent Graphs and Cyclic Polytope Triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Malte Renken, Vincent Froese","submitted_at":"2019-11-12T17:09:31Z","abstract_excerpt":"We prove a bijection between the triangulations of the 3-dimensional cyclic polytope C(n+2, 3) and persistent graphs with n vertices. We show that under this bijection the Stasheff-Tamari orders on triangulations naturally translate to subgraph inclusion between persistent graphs. Moreover, we describe a connection to the second higher Bruhat order B(n, 2). We additionally give an algorithm to efficiently enumerate all persistent graphs on n vertices and thus all triangulations of C(n+2, 3)."},"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":"1911.05012","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-11-12T17:09:31Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"fb5c60a148663e98a428a597ce82557cb0fe8b34be67334278fda20b2bbd537b","abstract_canon_sha256":"2f2b8d4ce8560ff716d68f8085019ae747ca27a6769a57a6f224973fe9156257"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:15:21.809483Z","signature_b64":"SfSUzN6PHrvRUmSf3BbUOzMsWA0arkkqVuOEpxAlB125T3ll3Ns0W0/c2mMktDbPm1ib+ze5YaJNA+r014RkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb4bd4c7fd709f2d9b73072709545c2234b6b907625bb9382cac8e66e8e16aca","last_reissued_at":"2026-07-05T02:15:21.809054Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:15:21.809054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Persistent Graphs and Cyclic Polytope Triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Malte Renken, Vincent Froese","submitted_at":"2019-11-12T17:09:31Z","abstract_excerpt":"We prove a bijection between the triangulations of the 3-dimensional cyclic polytope C(n+2, 3) and persistent graphs with n vertices. We show that under this bijection the Stasheff-Tamari orders on triangulations naturally translate to subgraph inclusion between persistent graphs. Moreover, we describe a connection to the second higher Bruhat order B(n, 2). We additionally give an algorithm to efficiently enumerate all persistent graphs on n vertices and thus all triangulations of C(n+2, 3)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.05012","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/1911.05012/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":"1911.05012","created_at":"2026-07-05T02:15:21.809111+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.05012v2","created_at":"2026-07-05T02:15:21.809111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.05012","created_at":"2026-07-05T02:15:21.809111+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NF5JR75OCPS","created_at":"2026-07-05T02:15:21.809111+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NF5JR75OCPS3G3T","created_at":"2026-07-05T02:15:21.809111+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NF5JR75","created_at":"2026-07-05T02:15:21.809111+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/5NF5JR75OCPS3G3TA4TQSVC4EI","json":"https://pith.science/pith/5NF5JR75OCPS3G3TA4TQSVC4EI.json","graph_json":"https://pith.science/api/pith-number/5NF5JR75OCPS3G3TA4TQSVC4EI/graph.json","events_json":"https://pith.science/api/pith-number/5NF5JR75OCPS3G3TA4TQSVC4EI/events.json","paper":"https://pith.science/paper/5NF5JR75"},"agent_actions":{"view_html":"https://pith.science/pith/5NF5JR75OCPS3G3TA4TQSVC4EI","download_json":"https://pith.science/pith/5NF5JR75OCPS3G3TA4TQSVC4EI.json","view_paper":"https://pith.science/paper/5NF5JR75","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.05012&json=true","fetch_graph":"https://pith.science/api/pith-number/5NF5JR75OCPS3G3TA4TQSVC4EI/graph.json","fetch_events":"https://pith.science/api/pith-number/5NF5JR75OCPS3G3TA4TQSVC4EI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NF5JR75OCPS3G3TA4TQSVC4EI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NF5JR75OCPS3G3TA4TQSVC4EI/action/storage_attestation","attest_author":"https://pith.science/pith/5NF5JR75OCPS3G3TA4TQSVC4EI/action/author_attestation","sign_citation":"https://pith.science/pith/5NF5JR75OCPS3G3TA4TQSVC4EI/action/citation_signature","submit_replication":"https://pith.science/pith/5NF5JR75OCPS3G3TA4TQSVC4EI/action/replication_record"}},"created_at":"2026-07-05T02:15:21.809111+00:00","updated_at":"2026-07-05T02:15:21.809111+00:00"}