{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5JK3PI34I2QQHRK27DIB6W4AUK","short_pith_number":"pith:5JK3PI34","schema_version":"1.0","canonical_sha256":"ea55b7a37c46a103c55af8d01f5b80a2ba25e722b93770519c9e4abbca8ba95a","source":{"kind":"arxiv","id":"1402.7326","version":1},"attestation_state":"computed","paper":{"title":"Analysis of the parallel peeling algorithm: a short proof","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pu Gao","submitted_at":"2014-02-28T17:29:26Z","abstract_excerpt":"A recent paper by Jiang, Mitzenmacher and Thaler upper bounded the number of rounds needed in a parallel peeling algorithm applied to a random hypergraph whose edge density is below the k-core emergence threshold. I gave a very short proof of their result in this note."},"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":"1402.7326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-28T17:29:26Z","cross_cats_sorted":[],"title_canon_sha256":"7a2554dbb0ba6e1b56e7bbee291708d0b023c8b38fc9c18c452ba96e901378a6","abstract_canon_sha256":"077ecf9e7b3ec5d65fb1e5070f84c4e098e8df3f9b9ef5d9019bb10100b79d46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:34.305506Z","signature_b64":"vdZBHRGp8iAvcEAx5tQoZedEWDbjESIiRccqpc3YTHSRIkUfYon+w9lPuHwmCXcA4eVUeEkAUwtb/FSZn2giDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea55b7a37c46a103c55af8d01f5b80a2ba25e722b93770519c9e4abbca8ba95a","last_reissued_at":"2026-05-18T02:57:34.304824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:34.304824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of the parallel peeling algorithm: a short proof","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pu Gao","submitted_at":"2014-02-28T17:29:26Z","abstract_excerpt":"A recent paper by Jiang, Mitzenmacher and Thaler upper bounded the number of rounds needed in a parallel peeling algorithm applied to a random hypergraph whose edge density is below the k-core emergence threshold. I gave a very short proof of their result in this note."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7326","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":"1402.7326","created_at":"2026-05-18T02:57:34.304931+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.7326v1","created_at":"2026-05-18T02:57:34.304931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7326","created_at":"2026-05-18T02:57:34.304931+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JK3PI34I2QQ","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JK3PI34I2QQHRK2","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JK3PI34","created_at":"2026-05-18T12:28:14.216126+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/5JK3PI34I2QQHRK27DIB6W4AUK","json":"https://pith.science/pith/5JK3PI34I2QQHRK27DIB6W4AUK.json","graph_json":"https://pith.science/api/pith-number/5JK3PI34I2QQHRK27DIB6W4AUK/graph.json","events_json":"https://pith.science/api/pith-number/5JK3PI34I2QQHRK27DIB6W4AUK/events.json","paper":"https://pith.science/paper/5JK3PI34"},"agent_actions":{"view_html":"https://pith.science/pith/5JK3PI34I2QQHRK27DIB6W4AUK","download_json":"https://pith.science/pith/5JK3PI34I2QQHRK27DIB6W4AUK.json","view_paper":"https://pith.science/paper/5JK3PI34","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.7326&json=true","fetch_graph":"https://pith.science/api/pith-number/5JK3PI34I2QQHRK27DIB6W4AUK/graph.json","fetch_events":"https://pith.science/api/pith-number/5JK3PI34I2QQHRK27DIB6W4AUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JK3PI34I2QQHRK27DIB6W4AUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JK3PI34I2QQHRK27DIB6W4AUK/action/storage_attestation","attest_author":"https://pith.science/pith/5JK3PI34I2QQHRK27DIB6W4AUK/action/author_attestation","sign_citation":"https://pith.science/pith/5JK3PI34I2QQHRK27DIB6W4AUK/action/citation_signature","submit_replication":"https://pith.science/pith/5JK3PI34I2QQHRK27DIB6W4AUK/action/replication_record"}},"created_at":"2026-05-18T02:57:34.304931+00:00","updated_at":"2026-05-18T02:57:34.304931+00:00"}