{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FT2RS6KV4S3WJKQPEKTOS2KMP7","short_pith_number":"pith:FT2RS6KV","schema_version":"1.0","canonical_sha256":"2cf5197955e4b764aa0f22a6e9694c7fd796614b39f85fc9d8d6d196e3239d21","source":{"kind":"arxiv","id":"1501.02695","version":5},"attestation_state":"computed","paper":{"title":"The stripping process can be slow: part I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mike Molloy, Pu Gao","submitted_at":"2015-01-12T16:23:12Z","abstract_excerpt":"Given an integer k, we consider the parallel k-stripping process applied to a hypergraph H: removing all vertices with degree less than k in each iteration until reaching the k-core of H. Take H as H_r(n,m): a random r-uniform hypergraph on n vertices and m hyperedges with the uniform distribution. Fixing k,r\\ge 2 with (k,r)\\neq (2,2), it has previously been proved that there is a constant c_{r,k} such that for all m=cn with constant c\\neq c_{r,k}, with high probability, the parallel k-stripping process takes O(\\log n) iterations. In this paper we investigate the critical case when c=c_{r,k}+o"},"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":"1501.02695","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-12T16:23:12Z","cross_cats_sorted":[],"title_canon_sha256":"beba9272f55f5dcbf73510436c81a19d4693c73c6c70f2910bee5a4f327df9ee","abstract_canon_sha256":"5ee25b9d75af55428c65294a19b6d5acd05af0055de7f2dafecc528774d1b34b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:49.873054Z","signature_b64":"FBF07L8jGQbW+8EAcNeAmCK/zbr0ZaCNHxaT8KfPqlOH62TWRLppDs+AQGrPg4HLfOYoNbvbUHbc1UUqPYPADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cf5197955e4b764aa0f22a6e9694c7fd796614b39f85fc9d8d6d196e3239d21","last_reissued_at":"2026-05-18T00:46:49.872438Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:49.872438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The stripping process can be slow: part I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mike Molloy, Pu Gao","submitted_at":"2015-01-12T16:23:12Z","abstract_excerpt":"Given an integer k, we consider the parallel k-stripping process applied to a hypergraph H: removing all vertices with degree less than k in each iteration until reaching the k-core of H. Take H as H_r(n,m): a random r-uniform hypergraph on n vertices and m hyperedges with the uniform distribution. Fixing k,r\\ge 2 with (k,r)\\neq (2,2), it has previously been proved that there is a constant c_{r,k} such that for all m=cn with constant c\\neq c_{r,k}, with high probability, the parallel k-stripping process takes O(\\log n) iterations. In this paper we investigate the critical case when c=c_{r,k}+o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02695","kind":"arxiv","version":5},"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":"1501.02695","created_at":"2026-05-18T00:46:49.872551+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.02695v5","created_at":"2026-05-18T00:46:49.872551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02695","created_at":"2026-05-18T00:46:49.872551+00:00"},{"alias_kind":"pith_short_12","alias_value":"FT2RS6KV4S3W","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"FT2RS6KV4S3WJKQP","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"FT2RS6KV","created_at":"2026-05-18T12:29:22.688609+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/FT2RS6KV4S3WJKQPEKTOS2KMP7","json":"https://pith.science/pith/FT2RS6KV4S3WJKQPEKTOS2KMP7.json","graph_json":"https://pith.science/api/pith-number/FT2RS6KV4S3WJKQPEKTOS2KMP7/graph.json","events_json":"https://pith.science/api/pith-number/FT2RS6KV4S3WJKQPEKTOS2KMP7/events.json","paper":"https://pith.science/paper/FT2RS6KV"},"agent_actions":{"view_html":"https://pith.science/pith/FT2RS6KV4S3WJKQPEKTOS2KMP7","download_json":"https://pith.science/pith/FT2RS6KV4S3WJKQPEKTOS2KMP7.json","view_paper":"https://pith.science/paper/FT2RS6KV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.02695&json=true","fetch_graph":"https://pith.science/api/pith-number/FT2RS6KV4S3WJKQPEKTOS2KMP7/graph.json","fetch_events":"https://pith.science/api/pith-number/FT2RS6KV4S3WJKQPEKTOS2KMP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FT2RS6KV4S3WJKQPEKTOS2KMP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FT2RS6KV4S3WJKQPEKTOS2KMP7/action/storage_attestation","attest_author":"https://pith.science/pith/FT2RS6KV4S3WJKQPEKTOS2KMP7/action/author_attestation","sign_citation":"https://pith.science/pith/FT2RS6KV4S3WJKQPEKTOS2KMP7/action/citation_signature","submit_replication":"https://pith.science/pith/FT2RS6KV4S3WJKQPEKTOS2KMP7/action/replication_record"}},"created_at":"2026-05-18T00:46:49.872551+00:00","updated_at":"2026-05-18T00:46:49.872551+00:00"}