{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MFWY6VG7P4ZERNNOQV36MENGHE","short_pith_number":"pith:MFWY6VG7","schema_version":"1.0","canonical_sha256":"616d8f54df7f3248b5ae8577e611a63913fa4432ba4bcab2315f10b0c5acb507","source":{"kind":"arxiv","id":"1312.0526","version":1},"attestation_state":"computed","paper":{"title":"Cache-Oblivious Peeling of Random Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Giuseppe Ottaviano, Paolo Boldi, Rossano Venturini, Sebastiano Vigna","submitted_at":"2013-12-02T17:37:51Z","abstract_excerpt":"The computation of a peeling order in a randomly generated hypergraph is the most time-consuming step in a number of constructions, such as perfect hashing schemes, random $r$-SAT solvers, error-correcting codes, and approximate set encodings. While there exists a straightforward linear time algorithm, its poor I/O performance makes it impractical for hypergraphs whose size exceeds the available internal memory.\n  We show how to reduce the computation of a peeling order to a small number of sequential scans and sorts, and analyze its I/O complexity in the cache-oblivious model. The resulting a"},"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":"1312.0526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-02T17:37:51Z","cross_cats_sorted":[],"title_canon_sha256":"9037c1ccd79c1507e10ade6c47cb241e898d19b3845ec78a7036c55de2fa83bc","abstract_canon_sha256":"44296a6b92f19e8778ac0bcdec3c4c6706d7e92ed70989a0c7e0352781519c7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:45.453983Z","signature_b64":"X5IAG3+j5pWHGT17eqI9ufNnmi2XDP9d8zgbHABUS2CeXap84bPCv6LKzfXoRV7MiTEOSPk/o6e9jLcCaICiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"616d8f54df7f3248b5ae8577e611a63913fa4432ba4bcab2315f10b0c5acb507","last_reissued_at":"2026-05-18T03:05:45.453347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:45.453347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cache-Oblivious Peeling of Random Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Giuseppe Ottaviano, Paolo Boldi, Rossano Venturini, Sebastiano Vigna","submitted_at":"2013-12-02T17:37:51Z","abstract_excerpt":"The computation of a peeling order in a randomly generated hypergraph is the most time-consuming step in a number of constructions, such as perfect hashing schemes, random $r$-SAT solvers, error-correcting codes, and approximate set encodings. While there exists a straightforward linear time algorithm, its poor I/O performance makes it impractical for hypergraphs whose size exceeds the available internal memory.\n  We show how to reduce the computation of a peeling order to a small number of sequential scans and sorts, and analyze its I/O complexity in the cache-oblivious model. The resulting a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0526","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":"1312.0526","created_at":"2026-05-18T03:05:45.453442+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0526v1","created_at":"2026-05-18T03:05:45.453442+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0526","created_at":"2026-05-18T03:05:45.453442+00:00"},{"alias_kind":"pith_short_12","alias_value":"MFWY6VG7P4ZE","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MFWY6VG7P4ZERNNO","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MFWY6VG7","created_at":"2026-05-18T12:27:52.871228+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/MFWY6VG7P4ZERNNOQV36MENGHE","json":"https://pith.science/pith/MFWY6VG7P4ZERNNOQV36MENGHE.json","graph_json":"https://pith.science/api/pith-number/MFWY6VG7P4ZERNNOQV36MENGHE/graph.json","events_json":"https://pith.science/api/pith-number/MFWY6VG7P4ZERNNOQV36MENGHE/events.json","paper":"https://pith.science/paper/MFWY6VG7"},"agent_actions":{"view_html":"https://pith.science/pith/MFWY6VG7P4ZERNNOQV36MENGHE","download_json":"https://pith.science/pith/MFWY6VG7P4ZERNNOQV36MENGHE.json","view_paper":"https://pith.science/paper/MFWY6VG7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0526&json=true","fetch_graph":"https://pith.science/api/pith-number/MFWY6VG7P4ZERNNOQV36MENGHE/graph.json","fetch_events":"https://pith.science/api/pith-number/MFWY6VG7P4ZERNNOQV36MENGHE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MFWY6VG7P4ZERNNOQV36MENGHE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MFWY6VG7P4ZERNNOQV36MENGHE/action/storage_attestation","attest_author":"https://pith.science/pith/MFWY6VG7P4ZERNNOQV36MENGHE/action/author_attestation","sign_citation":"https://pith.science/pith/MFWY6VG7P4ZERNNOQV36MENGHE/action/citation_signature","submit_replication":"https://pith.science/pith/MFWY6VG7P4ZERNNOQV36MENGHE/action/replication_record"}},"created_at":"2026-05-18T03:05:45.453442+00:00","updated_at":"2026-05-18T03:05:45.453442+00:00"}