{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MFWY6VG7P4ZERNNOQV36MENGHE","short_pith_number":"pith:MFWY6VG7","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"},"canonical_sha256":"616d8f54df7f3248b5ae8577e611a63913fa4432ba4bcab2315f10b0c5acb507","source":{"kind":"arxiv","id":"1312.0526","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0526","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0526v1","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0526","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"MFWY6VG7P4ZE","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MFWY6VG7P4ZERNNO","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MFWY6VG7","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MFWY6VG7P4ZERNNOQV36MENGHE","target":"record","payload":{"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"},"canonical_sha256":"616d8f54df7f3248b5ae8577e611a63913fa4432ba4bcab2315f10b0c5acb507","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"},"source_kind":"arxiv","source_id":"1312.0526","source_version":1,"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-18T03:05:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/TQp2ufnqLkOvILSKDZSlD/zEzEfX5o6wP37j0qRrkEuHO6lJwE7fs5JBTMePhDcAnl35Jl2S9iPSjV/zcYQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:05:09.407823Z"},"content_sha256":"2bc93dd0579abcfa88f62e7ab121075f1c428b6ce0932abd0d22cf831cf6e5b2","schema_version":"1.0","event_id":"sha256:2bc93dd0579abcfa88f62e7ab121075f1c428b6ce0932abd0d22cf831cf6e5b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MFWY6VG7P4ZERNNOQV36MENGHE","target":"graph","payload":{"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"},"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-18T03:05:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Xl4FhhpD2gMJ7xRkAlqQOjN9pLUEuibHKc1LtVFc18/BshPWhsIRaSuZJXKv5bGjGBdhS88sqewNl7J1tb5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:05:09.408168Z"},"content_sha256":"67c0264148b11ffe41626fa3bcb671cadcc6f54045fcb49dd18ed47047c54896","schema_version":"1.0","event_id":"sha256:67c0264148b11ffe41626fa3bcb671cadcc6f54045fcb49dd18ed47047c54896"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MFWY6VG7P4ZERNNOQV36MENGHE/bundle.json","state_url":"https://pith.science/pith/MFWY6VG7P4ZERNNOQV36MENGHE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MFWY6VG7P4ZERNNOQV36MENGHE/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-02T05:05:09Z","links":{"resolver":"https://pith.science/pith/MFWY6VG7P4ZERNNOQV36MENGHE","bundle":"https://pith.science/pith/MFWY6VG7P4ZERNNOQV36MENGHE/bundle.json","state":"https://pith.science/pith/MFWY6VG7P4ZERNNOQV36MENGHE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MFWY6VG7P4ZERNNOQV36MENGHE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MFWY6VG7P4ZERNNOQV36MENGHE","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":"44296a6b92f19e8778ac0bcdec3c4c6706d7e92ed70989a0c7e0352781519c7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-02T17:37:51Z","title_canon_sha256":"9037c1ccd79c1507e10ade6c47cb241e898d19b3845ec78a7036c55de2fa83bc"},"schema_version":"1.0","source":{"id":"1312.0526","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0526","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0526v1","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0526","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"MFWY6VG7P4ZE","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MFWY6VG7P4ZERNNO","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MFWY6VG7","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:67c0264148b11ffe41626fa3bcb671cadcc6f54045fcb49dd18ed47047c54896","target":"graph","created_at":"2026-05-18T03:05:45Z","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":"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","authors_text":"Djamal Belazzougui, Giuseppe Ottaviano, Paolo Boldi, Rossano Venturini, Sebastiano Vigna","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-02T17:37:51Z","title":"Cache-Oblivious Peeling of Random Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0526","kind":"arxiv","version":1},"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:2bc93dd0579abcfa88f62e7ab121075f1c428b6ce0932abd0d22cf831cf6e5b2","target":"record","created_at":"2026-05-18T03:05:45Z","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":"44296a6b92f19e8778ac0bcdec3c4c6706d7e92ed70989a0c7e0352781519c7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-02T17:37:51Z","title_canon_sha256":"9037c1ccd79c1507e10ade6c47cb241e898d19b3845ec78a7036c55de2fa83bc"},"schema_version":"1.0","source":{"id":"1312.0526","kind":"arxiv","version":1}},"canonical_sha256":"616d8f54df7f3248b5ae8577e611a63913fa4432ba4bcab2315f10b0c5acb507","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"616d8f54df7f3248b5ae8577e611a63913fa4432ba4bcab2315f10b0c5acb507","first_computed_at":"2026-05-18T03:05:45.453347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:45.453347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X5IAG3+j5pWHGT17eqI9ufNnmi2XDP9d8zgbHABUS2CeXap84bPCv6LKzfXoRV7MiTEOSPk/o6e9jLcCaICiDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:45.453983Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.0526","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bc93dd0579abcfa88f62e7ab121075f1c428b6ce0932abd0d22cf831cf6e5b2","sha256:67c0264148b11ffe41626fa3bcb671cadcc6f54045fcb49dd18ed47047c54896"],"state_sha256":"253f14ceca0e06c0e0bbaf767e2e2b51ebe729115fb864c8ad6742a75231dea7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r9UMu+wpTTXw1mwkkzkoheArA5lELBbKx9E/6U1NvEk8PiHu38aJC2nHynaJHAG0YZ6PMpzaignEGwKpU6CzCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:05:09.410107Z","bundle_sha256":"cd3d08820a09422bf949f61ada78547b8b63a6e748650cc50827b178109e2ac4"}}