{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FT2RS6KV4S3WJKQPEKTOS2KMP7","short_pith_number":"pith:FT2RS6KV","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"},"canonical_sha256":"2cf5197955e4b764aa0f22a6e9694c7fd796614b39f85fc9d8d6d196e3239d21","source":{"kind":"arxiv","id":"1501.02695","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02695","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02695v5","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02695","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"pith_short_12","alias_value":"FT2RS6KV4S3W","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FT2RS6KV4S3WJKQP","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FT2RS6KV","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FT2RS6KV4S3WJKQPEKTOS2KMP7","target":"record","payload":{"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"},"canonical_sha256":"2cf5197955e4b764aa0f22a6e9694c7fd796614b39f85fc9d8d6d196e3239d21","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"},"source_kind":"arxiv","source_id":"1501.02695","source_version":5,"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-18T00:46:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yzTg08XRrsyhGb0lurzMMw7Snq32GREOLDk7EiTXAafGrnxQQi3NcQxmsrAtVcza49SJESGuEyOJyJFloaeXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:50:07.013708Z"},"content_sha256":"51e3f5dde8c7d29c0f3e4afe40dcd872708f6d8fe806f4dcf460d591aa44a756","schema_version":"1.0","event_id":"sha256:51e3f5dde8c7d29c0f3e4afe40dcd872708f6d8fe806f4dcf460d591aa44a756"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FT2RS6KV4S3WJKQPEKTOS2KMP7","target":"graph","payload":{"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"},"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-18T00:46:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uWuCeVBp0EI2wdvVKcj1os0CHqXJUeOdsMJ/5f7CsprG9FTMEUBZ1JnJ9NErSfvNLpMlM3Rj8Y5ldlFiyG0jDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:50:07.014066Z"},"content_sha256":"e90cfbf83788d7114ca4aa15fa0fbe23b81680e11bb9c3826444bd29dde21867","schema_version":"1.0","event_id":"sha256:e90cfbf83788d7114ca4aa15fa0fbe23b81680e11bb9c3826444bd29dde21867"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FT2RS6KV4S3WJKQPEKTOS2KMP7/bundle.json","state_url":"https://pith.science/pith/FT2RS6KV4S3WJKQPEKTOS2KMP7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FT2RS6KV4S3WJKQPEKTOS2KMP7/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-06-01T12:50:07Z","links":{"resolver":"https://pith.science/pith/FT2RS6KV4S3WJKQPEKTOS2KMP7","bundle":"https://pith.science/pith/FT2RS6KV4S3WJKQPEKTOS2KMP7/bundle.json","state":"https://pith.science/pith/FT2RS6KV4S3WJKQPEKTOS2KMP7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FT2RS6KV4S3WJKQPEKTOS2KMP7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FT2RS6KV4S3WJKQPEKTOS2KMP7","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":"5ee25b9d75af55428c65294a19b6d5acd05af0055de7f2dafecc528774d1b34b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-12T16:23:12Z","title_canon_sha256":"beba9272f55f5dcbf73510436c81a19d4693c73c6c70f2910bee5a4f327df9ee"},"schema_version":"1.0","source":{"id":"1501.02695","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02695","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02695v5","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02695","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"pith_short_12","alias_value":"FT2RS6KV4S3W","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FT2RS6KV4S3WJKQP","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FT2RS6KV","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:e90cfbf83788d7114ca4aa15fa0fbe23b81680e11bb9c3826444bd29dde21867","target":"graph","created_at":"2026-05-18T00:46:49Z","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":"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","authors_text":"Mike Molloy, Pu Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-12T16:23:12Z","title":"The stripping process can be slow: part I"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02695","kind":"arxiv","version":5},"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:51e3f5dde8c7d29c0f3e4afe40dcd872708f6d8fe806f4dcf460d591aa44a756","target":"record","created_at":"2026-05-18T00:46:49Z","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":"5ee25b9d75af55428c65294a19b6d5acd05af0055de7f2dafecc528774d1b34b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-12T16:23:12Z","title_canon_sha256":"beba9272f55f5dcbf73510436c81a19d4693c73c6c70f2910bee5a4f327df9ee"},"schema_version":"1.0","source":{"id":"1501.02695","kind":"arxiv","version":5}},"canonical_sha256":"2cf5197955e4b764aa0f22a6e9694c7fd796614b39f85fc9d8d6d196e3239d21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2cf5197955e4b764aa0f22a6e9694c7fd796614b39f85fc9d8d6d196e3239d21","first_computed_at":"2026-05-18T00:46:49.872438Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:49.872438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FBF07L8jGQbW+8EAcNeAmCK/zbr0ZaCNHxaT8KfPqlOH62TWRLppDs+AQGrPg4HLfOYoNbvbUHbc1UUqPYPADw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:49.873054Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.02695","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51e3f5dde8c7d29c0f3e4afe40dcd872708f6d8fe806f4dcf460d591aa44a756","sha256:e90cfbf83788d7114ca4aa15fa0fbe23b81680e11bb9c3826444bd29dde21867"],"state_sha256":"e83db0b583b31c87e37f822b5ffc23c2f4f23e995f4f68387ed88a72e795c1e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VBFpmSV7nJHDz6uIR29oMqQC5BvkER8cVqaXir+ef6qvosgPdvTOildOvLuW/9P1tHRMZhH1QKvsEcmBJLQzDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:50:07.016125Z","bundle_sha256":"2e5a3de13c3e05f40ecda22e35e7d007c25c7bb3514cc688fcf36f29ddab1df5"}}