{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NDZLA7RLQFVJZFISKL5X73LPEC","short_pith_number":"pith:NDZLA7RL","schema_version":"1.0","canonical_sha256":"68f2b07e2b816a9c951252fb7fed6f20bfa1aaeb0116ff17a87679644052c9f9","source":{"kind":"arxiv","id":"1903.05055","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.05055","created_at":"2026-05-17T23:51:26.432166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.05055v1","created_at":"2026-05-17T23:51:26.432166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05055","created_at":"2026-05-17T23:51:26.432166+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDZLA7RLQFVJ","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDZLA7RLQFVJZFIS","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDZLA7RL","created_at":"2026-05-18T12:33:24.271573+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/NDZLA7RLQFVJZFISKL5X73LPEC","json":"https://pith.science/pith/NDZLA7RLQFVJZFISKL5X73LPEC.json","graph_json":"https://pith.science/api/pith-number/NDZLA7RLQFVJZFISKL5X73LPEC/graph.json","events_json":"https://pith.science/api/pith-number/NDZLA7RLQFVJZFISKL5X73LPEC/events.json","paper":"https://pith.science/paper/NDZLA7RL"},"agent_actions":{"view_html":"https://pith.science/pith/NDZLA7RLQFVJZFISKL5X73LPEC","download_json":"https://pith.science/pith/NDZLA7RLQFVJZFISKL5X73LPEC.json","view_paper":"https://pith.science/paper/NDZLA7RL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.05055&json=true","fetch_graph":"https://pith.science/api/pith-number/NDZLA7RLQFVJZFISKL5X73LPEC/graph.json","fetch_events":"https://pith.science/api/pith-number/NDZLA7RLQFVJZFISKL5X73LPEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDZLA7RLQFVJZFISKL5X73LPEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDZLA7RLQFVJZFISKL5X73LPEC/action/storage_attestation","attest_author":"https://pith.science/pith/NDZLA7RLQFVJZFISKL5X73LPEC/action/author_attestation","sign_citation":"https://pith.science/pith/NDZLA7RLQFVJZFISKL5X73LPEC/action/citation_signature","submit_replication":"https://pith.science/pith/NDZLA7RLQFVJZFISKL5X73LPEC/action/replication_record"}},"created_at":"2026-05-17T23:51:26.432166+00:00","updated_at":"2026-05-17T23:51:26.432166+00:00"}