{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2TOHINKBBUZ4DYHKGVMM6O4UL7","short_pith_number":"pith:2TOHINKB","canonical_record":{"source":{"id":"1404.4239","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-16T13:36:00Z","cross_cats_sorted":["cs.CG","math.AT","math.GT"],"title_canon_sha256":"e5d92a66611f326fd12a6199ff9420148ed2717075ad098c3349427c9dc6f43b","abstract_canon_sha256":"5950424e832e04532856279cec3142d8c88300479e00bd4fd02002502521af32"},"schema_version":"1.0"},"canonical_sha256":"d4dc7435410d33c1e0ea3558cf3b945ffb9c2c0c13947e7f0546f16aed5e7800","source":{"kind":"arxiv","id":"1404.4239","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4239","created_at":"2026-05-18T01:02:46Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4239v3","created_at":"2026-05-18T01:02:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4239","created_at":"2026-05-18T01:02:46Z"},{"alias_kind":"pith_short_12","alias_value":"2TOHINKBBUZ4","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2TOHINKBBUZ4DYHK","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2TOHINKB","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2TOHINKBBUZ4DYHKGVMM6O4UL7","target":"record","payload":{"canonical_record":{"source":{"id":"1404.4239","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-16T13:36:00Z","cross_cats_sorted":["cs.CG","math.AT","math.GT"],"title_canon_sha256":"e5d92a66611f326fd12a6199ff9420148ed2717075ad098c3349427c9dc6f43b","abstract_canon_sha256":"5950424e832e04532856279cec3142d8c88300479e00bd4fd02002502521af32"},"schema_version":"1.0"},"canonical_sha256":"d4dc7435410d33c1e0ea3558cf3b945ffb9c2c0c13947e7f0546f16aed5e7800","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:46.088723Z","signature_b64":"OoE7iIOyStnZbSKMggO9rpDfzkUY3HHJKdDYuQm7ClrdsMn8pxeoqsA1amfIpvRMKJMNuhbUtyIb8PFY1XsADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4dc7435410d33c1e0ea3558cf3b945ffb9c2c0c13947e7f0546f16aed5e7800","last_reissued_at":"2026-05-18T01:02:46.088294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:46.088294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.4239","source_version":3,"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-05-18T01:02:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DaXkgX66Y8BsmDIVMtv+PJuMKq/v6W9iRCPYULHiRWb33dApchADXIJpRZPGb6vf1sS7on8mRAlg79FLKXNQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:07:15.584338Z"},"content_sha256":"ff340d45ed3ae8518a159ef9f04690838776452d85dde8d2108fd3aab3c44bcd","schema_version":"1.0","event_id":"sha256:ff340d45ed3ae8518a159ef9f04690838776452d85dde8d2108fd3aab3c44bcd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2TOHINKBBUZ4DYHKGVMM6O4UL7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extremal examples of collapsible complexes and random discrete Morse theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.AT","math.GT"],"primary_cat":"math.CO","authors_text":"Bruno Benedetti, Frank H. Lutz, Karim A. Adiprasito","submitted_at":"2014-04-16T13:36:00Z","abstract_excerpt":"We present extremal constructions connected with the property of simplicial collapsibility.\n  (1) For each $d \\ge 2$, there are collapsible (and shellable) simplicial $d$-complexes with only one free face. Also, there are non-evasive $d$-complexes with only two free faces. (Both results are optimal in all dimensions.)\n  (2) Optimal discrete Morse vectors need not be unique. We explicitly construct a contractible, but non-collapsible $3$-dimensional simplicial complex with face vector $f=(106,596,1064,573)$ that admits two distinct optimal discrete Morse vectors, $(1,1,1,0)$ and $(1,0,1,1)$. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4239","kind":"arxiv","version":3},"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"},"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-05-18T01:02:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2CSMTaCTERfTbfwh4Ri4mehueT3FMWKTTf+PkgkIzA0yKG3q1n2k/ck7AlPgYcO0kooJ0gac66qrQTJt5Rj2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:07:15.584953Z"},"content_sha256":"78267edb4dd42f3028a695a3d99cc9062440b79b435d2a4585eef696d02cf0ab","schema_version":"1.0","event_id":"sha256:78267edb4dd42f3028a695a3d99cc9062440b79b435d2a4585eef696d02cf0ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2TOHINKBBUZ4DYHKGVMM6O4UL7/bundle.json","state_url":"https://pith.science/pith/2TOHINKBBUZ4DYHKGVMM6O4UL7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2TOHINKBBUZ4DYHKGVMM6O4UL7/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-05-27T03:07:15Z","links":{"resolver":"https://pith.science/pith/2TOHINKBBUZ4DYHKGVMM6O4UL7","bundle":"https://pith.science/pith/2TOHINKBBUZ4DYHKGVMM6O4UL7/bundle.json","state":"https://pith.science/pith/2TOHINKBBUZ4DYHKGVMM6O4UL7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2TOHINKBBUZ4DYHKGVMM6O4UL7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2TOHINKBBUZ4DYHKGVMM6O4UL7","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":"5950424e832e04532856279cec3142d8c88300479e00bd4fd02002502521af32","cross_cats_sorted":["cs.CG","math.AT","math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-16T13:36:00Z","title_canon_sha256":"e5d92a66611f326fd12a6199ff9420148ed2717075ad098c3349427c9dc6f43b"},"schema_version":"1.0","source":{"id":"1404.4239","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4239","created_at":"2026-05-18T01:02:46Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4239v3","created_at":"2026-05-18T01:02:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4239","created_at":"2026-05-18T01:02:46Z"},{"alias_kind":"pith_short_12","alias_value":"2TOHINKBBUZ4","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2TOHINKBBUZ4DYHK","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2TOHINKB","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:78267edb4dd42f3028a695a3d99cc9062440b79b435d2a4585eef696d02cf0ab","target":"graph","created_at":"2026-05-18T01:02:46Z","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":"We present extremal constructions connected with the property of simplicial collapsibility.\n  (1) For each $d \\ge 2$, there are collapsible (and shellable) simplicial $d$-complexes with only one free face. Also, there are non-evasive $d$-complexes with only two free faces. (Both results are optimal in all dimensions.)\n  (2) Optimal discrete Morse vectors need not be unique. We explicitly construct a contractible, but non-collapsible $3$-dimensional simplicial complex with face vector $f=(106,596,1064,573)$ that admits two distinct optimal discrete Morse vectors, $(1,1,1,0)$ and $(1,0,1,1)$. In","authors_text":"Bruno Benedetti, Frank H. Lutz, Karim A. Adiprasito","cross_cats":["cs.CG","math.AT","math.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-16T13:36:00Z","title":"Extremal examples of collapsible complexes and random discrete Morse theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4239","kind":"arxiv","version":3},"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:ff340d45ed3ae8518a159ef9f04690838776452d85dde8d2108fd3aab3c44bcd","target":"record","created_at":"2026-05-18T01:02:46Z","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":"5950424e832e04532856279cec3142d8c88300479e00bd4fd02002502521af32","cross_cats_sorted":["cs.CG","math.AT","math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-16T13:36:00Z","title_canon_sha256":"e5d92a66611f326fd12a6199ff9420148ed2717075ad098c3349427c9dc6f43b"},"schema_version":"1.0","source":{"id":"1404.4239","kind":"arxiv","version":3}},"canonical_sha256":"d4dc7435410d33c1e0ea3558cf3b945ffb9c2c0c13947e7f0546f16aed5e7800","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4dc7435410d33c1e0ea3558cf3b945ffb9c2c0c13947e7f0546f16aed5e7800","first_computed_at":"2026-05-18T01:02:46.088294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:46.088294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OoE7iIOyStnZbSKMggO9rpDfzkUY3HHJKdDYuQm7ClrdsMn8pxeoqsA1amfIpvRMKJMNuhbUtyIb8PFY1XsADA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:46.088723Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4239","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff340d45ed3ae8518a159ef9f04690838776452d85dde8d2108fd3aab3c44bcd","sha256:78267edb4dd42f3028a695a3d99cc9062440b79b435d2a4585eef696d02cf0ab"],"state_sha256":"c10d52dc776de92ae73781fe6263d9c9e571b0e262395515593e768aaa82441a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fdyhl3vyuIJ6coXwCROnFosKeCUMiMwIGGksdxJ3W0lMsjyqD/SPVH2vWhb5MHORh2QZepOmOjxrFqfZNhWVDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:07:15.589047Z","bundle_sha256":"5d174386bdc494a91c4034b9007eebd009f5f59538c50f385956fa3d20a9d355"}}