{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KG36XDIUHPTDIEEKIFTOC2JUWJ","short_pith_number":"pith:KG36XDIU","schema_version":"1.0","canonical_sha256":"51b7eb8d143be634108a4166e16934b253f5db444252ec589f9a5e81df500c7d","source":{"kind":"arxiv","id":"1901.04934","version":1},"attestation_state":"computed","paper":{"title":"An Algorithm for Bounding the Probability of r-core Formation in k-uniform Random Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"George Bissias","submitted_at":"2019-01-15T16:57:17Z","abstract_excerpt":"We present an algorithm for bounding the probability of r-core formation in k-uniform hypergraphs. Understanding the probability of core formation is useful in numerous applications including bounds on the failure rate of Invertible Bloom Lookup Tables (IBLTs) and the probability that a boolean formula is satisfiable."},"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":"1901.04934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-15T16:57:17Z","cross_cats_sorted":[],"title_canon_sha256":"9089f27363f5be9fe3a2508acc29fafd2c81957f7187d5a4597610124b3655e6","abstract_canon_sha256":"113daaa962835a88dc67da7ff005fa846dbd8e1f6da131a96ecc615ec92383a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:16.124626Z","signature_b64":"vb/Mx+MWXYanQcg9fr9Tf9lnLAHiiUWL6Q0ZOZoZlidZeJH30mlyaIxFdyK2DPYrFD2LElcf0F8xhqTaA9yaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51b7eb8d143be634108a4166e16934b253f5db444252ec589f9a5e81df500c7d","last_reissued_at":"2026-05-17T23:56:16.124011Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:16.124011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algorithm for Bounding the Probability of r-core Formation in k-uniform Random Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"George Bissias","submitted_at":"2019-01-15T16:57:17Z","abstract_excerpt":"We present an algorithm for bounding the probability of r-core formation in k-uniform hypergraphs. Understanding the probability of core formation is useful in numerous applications including bounds on the failure rate of Invertible Bloom Lookup Tables (IBLTs) and the probability that a boolean formula is satisfiable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04934","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":"1901.04934","created_at":"2026-05-17T23:56:16.124104+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.04934v1","created_at":"2026-05-17T23:56:16.124104+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04934","created_at":"2026-05-17T23:56:16.124104+00:00"},{"alias_kind":"pith_short_12","alias_value":"KG36XDIUHPTD","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KG36XDIUHPTDIEEK","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KG36XDIU","created_at":"2026-05-18T12:33:21.387695+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/KG36XDIUHPTDIEEKIFTOC2JUWJ","json":"https://pith.science/pith/KG36XDIUHPTDIEEKIFTOC2JUWJ.json","graph_json":"https://pith.science/api/pith-number/KG36XDIUHPTDIEEKIFTOC2JUWJ/graph.json","events_json":"https://pith.science/api/pith-number/KG36XDIUHPTDIEEKIFTOC2JUWJ/events.json","paper":"https://pith.science/paper/KG36XDIU"},"agent_actions":{"view_html":"https://pith.science/pith/KG36XDIUHPTDIEEKIFTOC2JUWJ","download_json":"https://pith.science/pith/KG36XDIUHPTDIEEKIFTOC2JUWJ.json","view_paper":"https://pith.science/paper/KG36XDIU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.04934&json=true","fetch_graph":"https://pith.science/api/pith-number/KG36XDIUHPTDIEEKIFTOC2JUWJ/graph.json","fetch_events":"https://pith.science/api/pith-number/KG36XDIUHPTDIEEKIFTOC2JUWJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KG36XDIUHPTDIEEKIFTOC2JUWJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KG36XDIUHPTDIEEKIFTOC2JUWJ/action/storage_attestation","attest_author":"https://pith.science/pith/KG36XDIUHPTDIEEKIFTOC2JUWJ/action/author_attestation","sign_citation":"https://pith.science/pith/KG36XDIUHPTDIEEKIFTOC2JUWJ/action/citation_signature","submit_replication":"https://pith.science/pith/KG36XDIUHPTDIEEKIFTOC2JUWJ/action/replication_record"}},"created_at":"2026-05-17T23:56:16.124104+00:00","updated_at":"2026-05-17T23:56:16.124104+00:00"}