{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GAYAC4TQK36ZJ5NSOKR7DSVDYA","short_pith_number":"pith:GAYAC4TQ","schema_version":"1.0","canonical_sha256":"303001727056fd94f5b272a3f1caa3c014307f72ca5bdc8b1e7691b1c381bcbf","source":{"kind":"arxiv","id":"1907.04749","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.04749","created_at":"2026-05-17T23:40:56.866849+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.04749v1","created_at":"2026-05-17T23:40:56.866849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04749","created_at":"2026-05-17T23:40:56.866849+00:00"},{"alias_kind":"pith_short_12","alias_value":"GAYAC4TQK36Z","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GAYAC4TQK36ZJ5NS","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GAYAC4TQ","created_at":"2026-05-18T12:33:18.533446+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/GAYAC4TQK36ZJ5NSOKR7DSVDYA","json":"https://pith.science/pith/GAYAC4TQK36ZJ5NSOKR7DSVDYA.json","graph_json":"https://pith.science/api/pith-number/GAYAC4TQK36ZJ5NSOKR7DSVDYA/graph.json","events_json":"https://pith.science/api/pith-number/GAYAC4TQK36ZJ5NSOKR7DSVDYA/events.json","paper":"https://pith.science/paper/GAYAC4TQ"},"agent_actions":{"view_html":"https://pith.science/pith/GAYAC4TQK36ZJ5NSOKR7DSVDYA","download_json":"https://pith.science/pith/GAYAC4TQK36ZJ5NSOKR7DSVDYA.json","view_paper":"https://pith.science/paper/GAYAC4TQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.04749&json=true","fetch_graph":"https://pith.science/api/pith-number/GAYAC4TQK36ZJ5NSOKR7DSVDYA/graph.json","fetch_events":"https://pith.science/api/pith-number/GAYAC4TQK36ZJ5NSOKR7DSVDYA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GAYAC4TQK36ZJ5NSOKR7DSVDYA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GAYAC4TQK36ZJ5NSOKR7DSVDYA/action/storage_attestation","attest_author":"https://pith.science/pith/GAYAC4TQK36ZJ5NSOKR7DSVDYA/action/author_attestation","sign_citation":"https://pith.science/pith/GAYAC4TQK36ZJ5NSOKR7DSVDYA/action/citation_signature","submit_replication":"https://pith.science/pith/GAYAC4TQK36ZJ5NSOKR7DSVDYA/action/replication_record"}},"created_at":"2026-05-17T23:40:56.866849+00:00","updated_at":"2026-05-17T23:40:56.866849+00:00"}