{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NDZLA7RLQFVJZFISKL5X73LPEC","short_pith_number":"pith:NDZLA7RL","canonical_record":{"source":{"id":"1903.05055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-12T17:04:22Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"ca0e5c6c90f57f47b489cb238d6c2d28eb442813353aef523fa54ae1d9051153","abstract_canon_sha256":"6af93f9208170e23d88238cc4db6408f555463c53ac18e836d20bbb452778856"},"schema_version":"1.0"},"canonical_sha256":"68f2b07e2b816a9c951252fb7fed6f20bfa1aaeb0116ff17a87679644052c9f9","source":{"kind":"arxiv","id":"1903.05055","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05055","created_at":"2026-05-17T23:51:26Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05055v1","created_at":"2026-05-17T23:51:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05055","created_at":"2026-05-17T23:51:26Z"},{"alias_kind":"pith_short_12","alias_value":"NDZLA7RLQFVJ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NDZLA7RLQFVJZFIS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NDZLA7RL","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NDZLA7RLQFVJZFISKL5X73LPEC","target":"record","payload":{"canonical_record":{"source":{"id":"1903.05055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-12T17:04:22Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"ca0e5c6c90f57f47b489cb238d6c2d28eb442813353aef523fa54ae1d9051153","abstract_canon_sha256":"6af93f9208170e23d88238cc4db6408f555463c53ac18e836d20bbb452778856"},"schema_version":"1.0"},"canonical_sha256":"68f2b07e2b816a9c951252fb7fed6f20bfa1aaeb0116ff17a87679644052c9f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:26.432631Z","signature_b64":"Zt3gGqeVw/M1C6/JjGNkrIpcTR0S1kDYpTimJ/6g4pBOfAsw+c2mCeOLPr8MRDwARt48F93H5MyDTvP/i9+AAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68f2b07e2b816a9c951252fb7fed6f20bfa1aaeb0116ff17a87679644052c9f9","last_reissued_at":"2026-05-17T23:51:26.432065Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:26.432065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.05055","source_version":1,"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-17T23:51:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EJrVLoME6vQjupItn3JtorG4bkg8OFWjbQ2sP7mPV+rDKr53E3yRI4Yzf483NPW1tJkWw5vESgH+kVHLz2wSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T08:18:40.224538Z"},"content_sha256":"f772e3a698898f29ba5dfaf81d2a2b95fe5528ba6a636da1b424203b0fa96dd2","schema_version":"1.0","event_id":"sha256:f772e3a698898f29ba5dfaf81d2a2b95fe5528ba6a636da1b424203b0fa96dd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NDZLA7RLQFVJZFISKL5X73LPEC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Collapsibility of Random Clique Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"Greg Malen","submitted_at":"2019-03-12T17:04:22Z","abstract_excerpt":"We prove a sufficient condition for a finite clique complex to collapse to a $k$-dimensional complex, and use this to exhibit thresholds for $(k+1)$-collapsibility in a sparse random clique complex. In particular, if every strongly connected, pure $(k+1)$-dimensional subcomplex of a clique complex $X$ has a vertex of degree at most $2k+1$, then $X$ is $(k+1)$-collapsible. In the random model $X(n,p)$ of clique complexes of an Erd\\H{o}s--R\\'{e}nyi random graph $G(n,p)$, we then show that for any fixed $k\\geq 0$, if $p=n^{-\\alpha}$ for fixed $1/(k+1) < \\alpha < 1/k$, then a clique complex $X\\ove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05055","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"},"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-17T23:51:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nHWH/e8ELNAD2qsXpUdb9C65q7UTczxY0OCT3yy3YYixxWWYyC+gmEVK8aRFUXOaizQ652GBSwKhmQFDUJ/8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T08:18:40.224897Z"},"content_sha256":"d63ee7245c46f7e09eb39ae62fa495f22865d6dbbfd5d06818135c17893f4b9c","schema_version":"1.0","event_id":"sha256:d63ee7245c46f7e09eb39ae62fa495f22865d6dbbfd5d06818135c17893f4b9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NDZLA7RLQFVJZFISKL5X73LPEC/bundle.json","state_url":"https://pith.science/pith/NDZLA7RLQFVJZFISKL5X73LPEC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NDZLA7RLQFVJZFISKL5X73LPEC/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-12T08:18:40Z","links":{"resolver":"https://pith.science/pith/NDZLA7RLQFVJZFISKL5X73LPEC","bundle":"https://pith.science/pith/NDZLA7RLQFVJZFISKL5X73LPEC/bundle.json","state":"https://pith.science/pith/NDZLA7RLQFVJZFISKL5X73LPEC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NDZLA7RLQFVJZFISKL5X73LPEC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NDZLA7RLQFVJZFISKL5X73LPEC","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":"6af93f9208170e23d88238cc4db6408f555463c53ac18e836d20bbb452778856","cross_cats_sorted":["math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-12T17:04:22Z","title_canon_sha256":"ca0e5c6c90f57f47b489cb238d6c2d28eb442813353aef523fa54ae1d9051153"},"schema_version":"1.0","source":{"id":"1903.05055","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05055","created_at":"2026-05-17T23:51:26Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05055v1","created_at":"2026-05-17T23:51:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05055","created_at":"2026-05-17T23:51:26Z"},{"alias_kind":"pith_short_12","alias_value":"NDZLA7RLQFVJ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NDZLA7RLQFVJZFIS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NDZLA7RL","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:d63ee7245c46f7e09eb39ae62fa495f22865d6dbbfd5d06818135c17893f4b9c","target":"graph","created_at":"2026-05-17T23:51:26Z","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 prove a sufficient condition for a finite clique complex to collapse to a $k$-dimensional complex, and use this to exhibit thresholds for $(k+1)$-collapsibility in a sparse random clique complex. In particular, if every strongly connected, pure $(k+1)$-dimensional subcomplex of a clique complex $X$ has a vertex of degree at most $2k+1$, then $X$ is $(k+1)$-collapsible. In the random model $X(n,p)$ of clique complexes of an Erd\\H{o}s--R\\'{e}nyi random graph $G(n,p)$, we then show that for any fixed $k\\geq 0$, if $p=n^{-\\alpha}$ for fixed $1/(k+1) < \\alpha < 1/k$, then a clique complex $X\\ove","authors_text":"Greg Malen","cross_cats":["math.AT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-12T17:04:22Z","title":"Collapsibility of Random Clique Complexes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05055","kind":"arxiv","version":1},"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:f772e3a698898f29ba5dfaf81d2a2b95fe5528ba6a636da1b424203b0fa96dd2","target":"record","created_at":"2026-05-17T23:51:26Z","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":"6af93f9208170e23d88238cc4db6408f555463c53ac18e836d20bbb452778856","cross_cats_sorted":["math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-12T17:04:22Z","title_canon_sha256":"ca0e5c6c90f57f47b489cb238d6c2d28eb442813353aef523fa54ae1d9051153"},"schema_version":"1.0","source":{"id":"1903.05055","kind":"arxiv","version":1}},"canonical_sha256":"68f2b07e2b816a9c951252fb7fed6f20bfa1aaeb0116ff17a87679644052c9f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68f2b07e2b816a9c951252fb7fed6f20bfa1aaeb0116ff17a87679644052c9f9","first_computed_at":"2026-05-17T23:51:26.432065Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:26.432065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zt3gGqeVw/M1C6/JjGNkrIpcTR0S1kDYpTimJ/6g4pBOfAsw+c2mCeOLPr8MRDwARt48F93H5MyDTvP/i9+AAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:26.432631Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.05055","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f772e3a698898f29ba5dfaf81d2a2b95fe5528ba6a636da1b424203b0fa96dd2","sha256:d63ee7245c46f7e09eb39ae62fa495f22865d6dbbfd5d06818135c17893f4b9c"],"state_sha256":"f297e1ad03932bb9cb4c5eb065bf78f5a1b0ebab093a508b1e4e1590644735b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uYIEE9IQwekLXWawIWMToMqDv0dgsiQckfNkMwJgCwVr1mfpzDtaoN82wxu/dUM5ju5fS+rinMAkjqLmGfAADg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T08:18:40.227241Z","bundle_sha256":"ffa9379ff95d54c0428b4a2fe933d1936cd2d3c83e3de3d45a421c95fccc2a07"}}