{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GAYAC4TQK36ZJ5NSOKR7DSVDYA","short_pith_number":"pith:GAYAC4TQ","canonical_record":{"source":{"id":"1907.04749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-10T14:23:39Z","cross_cats_sorted":[],"title_canon_sha256":"2caa038c173dabaa83416b16b591df4085f0b30eaac89f4ad9bfc73997bc054e","abstract_canon_sha256":"8523eaec8aa807cc555fe49967156a4bae9c2176980b4df2efb7bfa7b0f510d3"},"schema_version":"1.0"},"canonical_sha256":"303001727056fd94f5b272a3f1caa3c014307f72ca5bdc8b1e7691b1c381bcbf","source":{"kind":"arxiv","id":"1907.04749","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04749","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04749v1","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04749","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"GAYAC4TQK36Z","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GAYAC4TQK36ZJ5NS","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GAYAC4TQ","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GAYAC4TQK36ZJ5NSOKR7DSVDYA","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-10T14:23:39Z","cross_cats_sorted":[],"title_canon_sha256":"2caa038c173dabaa83416b16b591df4085f0b30eaac89f4ad9bfc73997bc054e","abstract_canon_sha256":"8523eaec8aa807cc555fe49967156a4bae9c2176980b4df2efb7bfa7b0f510d3"},"schema_version":"1.0"},"canonical_sha256":"303001727056fd94f5b272a3f1caa3c014307f72ca5bdc8b1e7691b1c381bcbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:56.867238Z","signature_b64":"X1o1E5Klxprk4crk09CayvklQfRT9eZ/1/TByOhTpkRQzgEvDrEcvTi3Qv98xMQ2YIEw7KIYPanTmR61iMsiAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"303001727056fd94f5b272a3f1caa3c014307f72ca5bdc8b1e7691b1c381bcbf","last_reissued_at":"2026-05-17T23:40:56.866774Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:56.866774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04749","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-17T23:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pwzy8KF2FB4T1wPytfhfZpOP8o6pwn+Us5zlgF5HuypaLdXg0TrcJy3gRYzOM9SBx2gOAarH0lajaF7tFxQlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:44:43.788259Z"},"content_sha256":"91551308b64bec53011533b20346e7661887ddadddc274a5bcff86d20cac712b","schema_version":"1.0","event_id":"sha256:91551308b64bec53011533b20346e7661887ddadddc274a5bcff86d20cac712b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GAYAC4TQK36ZJ5NSOKR7DSVDYA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dense Peelable Random Uniform Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Dietzfelbinger, Stefan Walzer","submitted_at":"2019-07-10T14:23:39Z","abstract_excerpt":"We describe a new family of $k$-uniform hypergraphs with independent random edges. The hypergraphs have a high probability of being peelable, i.e. to admit no sub-hypergraph of minimum degree $2$, even when the edge density (number of edges over vertices) is close to $1$. In our construction, the vertex set is partitioned into linearly arranged segments and each edge is incident to random vertices of $k$ consecutive segments. Quite surprisingly, the linear geometry allows our graphs to be peeled \"from the outside in\". The density thresholds $f_k$ for peelability of our hypergraphs ($f_3 \\appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04749","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-17T23:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TxfPTb0XkcE9Q3Y3UPTBZ7bt57wIalRgDhUO0zCFfv/jMUWwI0paYtV4+pN7dGW9tP1hT5lSSA1L9oFLUL3ZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:44:43.788678Z"},"content_sha256":"7454cca6da0d1ad9e8b206b00d8bf48490a90611df10a403d73935536f459cd7","schema_version":"1.0","event_id":"sha256:7454cca6da0d1ad9e8b206b00d8bf48490a90611df10a403d73935536f459cd7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GAYAC4TQK36ZJ5NSOKR7DSVDYA/bundle.json","state_url":"https://pith.science/pith/GAYAC4TQK36ZJ5NSOKR7DSVDYA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GAYAC4TQK36ZJ5NSOKR7DSVDYA/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-05-25T09:44:43Z","links":{"resolver":"https://pith.science/pith/GAYAC4TQK36ZJ5NSOKR7DSVDYA","bundle":"https://pith.science/pith/GAYAC4TQK36ZJ5NSOKR7DSVDYA/bundle.json","state":"https://pith.science/pith/GAYAC4TQK36ZJ5NSOKR7DSVDYA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GAYAC4TQK36ZJ5NSOKR7DSVDYA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GAYAC4TQK36ZJ5NSOKR7DSVDYA","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":"8523eaec8aa807cc555fe49967156a4bae9c2176980b4df2efb7bfa7b0f510d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-10T14:23:39Z","title_canon_sha256":"2caa038c173dabaa83416b16b591df4085f0b30eaac89f4ad9bfc73997bc054e"},"schema_version":"1.0","source":{"id":"1907.04749","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04749","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04749v1","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04749","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"GAYAC4TQK36Z","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GAYAC4TQK36ZJ5NS","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GAYAC4TQ","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:7454cca6da0d1ad9e8b206b00d8bf48490a90611df10a403d73935536f459cd7","target":"graph","created_at":"2026-05-17T23:40:56Z","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":"We describe a new family of $k$-uniform hypergraphs with independent random edges. The hypergraphs have a high probability of being peelable, i.e. to admit no sub-hypergraph of minimum degree $2$, even when the edge density (number of edges over vertices) is close to $1$. In our construction, the vertex set is partitioned into linearly arranged segments and each edge is incident to random vertices of $k$ consecutive segments. Quite surprisingly, the linear geometry allows our graphs to be peeled \"from the outside in\". The density thresholds $f_k$ for peelability of our hypergraphs ($f_3 \\appro","authors_text":"Martin Dietzfelbinger, Stefan Walzer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-10T14:23:39Z","title":"Dense Peelable Random Uniform Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04749","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:91551308b64bec53011533b20346e7661887ddadddc274a5bcff86d20cac712b","target":"record","created_at":"2026-05-17T23:40:56Z","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":"8523eaec8aa807cc555fe49967156a4bae9c2176980b4df2efb7bfa7b0f510d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-10T14:23:39Z","title_canon_sha256":"2caa038c173dabaa83416b16b591df4085f0b30eaac89f4ad9bfc73997bc054e"},"schema_version":"1.0","source":{"id":"1907.04749","kind":"arxiv","version":1}},"canonical_sha256":"303001727056fd94f5b272a3f1caa3c014307f72ca5bdc8b1e7691b1c381bcbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"303001727056fd94f5b272a3f1caa3c014307f72ca5bdc8b1e7691b1c381bcbf","first_computed_at":"2026-05-17T23:40:56.866774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:56.866774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X1o1E5Klxprk4crk09CayvklQfRT9eZ/1/TByOhTpkRQzgEvDrEcvTi3Qv98xMQ2YIEw7KIYPanTmR61iMsiAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:56.867238Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04749","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91551308b64bec53011533b20346e7661887ddadddc274a5bcff86d20cac712b","sha256:7454cca6da0d1ad9e8b206b00d8bf48490a90611df10a403d73935536f459cd7"],"state_sha256":"38617365ca8ae801b3c5472de6f65357d163809967c7ba6aed263f6d85e544a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"asXxPEgo41ejA86Duw1izgielk4Siz8UEiQNQVUb2jkMvoriXFvrDYmjEjS6s778uU1ZuprO15GdBwr9kwRxAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T09:44:43.791296Z","bundle_sha256":"f676b71caab192bf4b7a72cd0671f3fabbbc68fcbc5f2580d2f41ffed57e0c97"}}