{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5NF5JR75OCPS3G3TA4TQSVC4EI","short_pith_number":"pith:5NF5JR75","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"},"canonical_sha256":"eb4bd4c7fd709f2d9b73072709545c2234b6b907625bb9382cac8e66e8e16aca","source":{"kind":"arxiv","id":"1911.05012","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.05012","created_at":"2026-07-05T02:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1911.05012v2","created_at":"2026-07-05T02:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.05012","created_at":"2026-07-05T02:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"5NF5JR75OCPS","created_at":"2026-07-05T02:15:21Z"},{"alias_kind":"pith_short_16","alias_value":"5NF5JR75OCPS3G3T","created_at":"2026-07-05T02:15:21Z"},{"alias_kind":"pith_short_8","alias_value":"5NF5JR75","created_at":"2026-07-05T02:15:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5NF5JR75OCPS3G3TA4TQSVC4EI","target":"record","payload":{"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"},"canonical_sha256":"eb4bd4c7fd709f2d9b73072709545c2234b6b907625bb9382cac8e66e8e16aca","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"},"source_kind":"arxiv","source_id":"1911.05012","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UT3DMtT01K7on4miuBnHiMYkfbWpYRgPeD3pJ/1DZ9oVjoapPyRxF/EAieCGEbRdFsxk5zovGtgLZq8q/bmSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T08:40:11.827949Z"},"content_sha256":"e8f9d46863e2413b2c5e5487fb25964d206c354b2c24fe307d1a33c25f564794","schema_version":"1.0","event_id":"sha256:e8f9d46863e2413b2c5e5487fb25964d206c354b2c24fe307d1a33c25f564794"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5NF5JR75OCPS3G3TA4TQSVC4EI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k5u+zLDqAEccZJpLRQbHPazmqV/duYWfcuaIgI3etH8HbOBYNqftBPAmUEKzRfYAYwdEkSS/t6j7qPtOJdIqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T08:40:11.828334Z"},"content_sha256":"8ce7f197d8713a41e584a0ea0b414dc1ab96e26a70b22f95c238524dbbf45f23","schema_version":"1.0","event_id":"sha256:8ce7f197d8713a41e584a0ea0b414dc1ab96e26a70b22f95c238524dbbf45f23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5NF5JR75OCPS3G3TA4TQSVC4EI/bundle.json","state_url":"https://pith.science/pith/5NF5JR75OCPS3G3TA4TQSVC4EI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5NF5JR75OCPS3G3TA4TQSVC4EI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T08:40:11Z","links":{"resolver":"https://pith.science/pith/5NF5JR75OCPS3G3TA4TQSVC4EI","bundle":"https://pith.science/pith/5NF5JR75OCPS3G3TA4TQSVC4EI/bundle.json","state":"https://pith.science/pith/5NF5JR75OCPS3G3TA4TQSVC4EI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5NF5JR75OCPS3G3TA4TQSVC4EI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5NF5JR75OCPS3G3TA4TQSVC4EI","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":"2f2b8d4ce8560ff716d68f8085019ae747ca27a6769a57a6f224973fe9156257","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-11-12T17:09:31Z","title_canon_sha256":"fb5c60a148663e98a428a597ce82557cb0fe8b34be67334278fda20b2bbd537b"},"schema_version":"1.0","source":{"id":"1911.05012","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.05012","created_at":"2026-07-05T02:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1911.05012v2","created_at":"2026-07-05T02:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.05012","created_at":"2026-07-05T02:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"5NF5JR75OCPS","created_at":"2026-07-05T02:15:21Z"},{"alias_kind":"pith_short_16","alias_value":"5NF5JR75OCPS3G3T","created_at":"2026-07-05T02:15:21Z"},{"alias_kind":"pith_short_8","alias_value":"5NF5JR75","created_at":"2026-07-05T02:15:21Z"}],"graph_snapshots":[{"event_id":"sha256:8ce7f197d8713a41e584a0ea0b414dc1ab96e26a70b22f95c238524dbbf45f23","target":"graph","created_at":"2026-07-05T02:15:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1911.05012/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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).","authors_text":"Malte Renken, Vincent Froese","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-11-12T17:09:31Z","title":"Persistent Graphs and Cyclic Polytope Triangulations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.05012","kind":"arxiv","version":2},"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:e8f9d46863e2413b2c5e5487fb25964d206c354b2c24fe307d1a33c25f564794","target":"record","created_at":"2026-07-05T02:15:21Z","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":"2f2b8d4ce8560ff716d68f8085019ae747ca27a6769a57a6f224973fe9156257","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-11-12T17:09:31Z","title_canon_sha256":"fb5c60a148663e98a428a597ce82557cb0fe8b34be67334278fda20b2bbd537b"},"schema_version":"1.0","source":{"id":"1911.05012","kind":"arxiv","version":2}},"canonical_sha256":"eb4bd4c7fd709f2d9b73072709545c2234b6b907625bb9382cac8e66e8e16aca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb4bd4c7fd709f2d9b73072709545c2234b6b907625bb9382cac8e66e8e16aca","first_computed_at":"2026-07-05T02:15:21.809054Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:15:21.809054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SfSUzN6PHrvRUmSf3BbUOzMsWA0arkkqVuOEpxAlB125T3ll3Ns0W0/c2mMktDbPm1ib+ze5YaJNA+r014RkDw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:15:21.809483Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.05012","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8f9d46863e2413b2c5e5487fb25964d206c354b2c24fe307d1a33c25f564794","sha256:8ce7f197d8713a41e584a0ea0b414dc1ab96e26a70b22f95c238524dbbf45f23"],"state_sha256":"e09237fa82c477ea240aa31e2f4e81c5f3e930a1e44b51959c31e7f74007ab40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZTj6bdKFBveDHQ8aZI6G+DxIHt3WecjB7BTznNCTPD1huNcV+vfwR3eR3oUx3cJimoP2kalXnv0b29juJCHoCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T08:40:11.830284Z","bundle_sha256":"dabf08f5b22ef76eb8211c59598d3183de8e74ff69a443baa319dd15eb30c650"}}