{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QPBKZEX6J7JWHW7YRXQ6GACN34","short_pith_number":"pith:QPBKZEX6","canonical_record":{"source":{"id":"1304.5932","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-22T12:45:15Z","cross_cats_sorted":[],"title_canon_sha256":"dcff3fcedf5d93e5285c49e62cd4f2f483264d71e87f702ad547a1533b72d3fa","abstract_canon_sha256":"db296358624d72f0b16a4183abe048235420e3123d95ca5a5e358c65d0bb0e81"},"schema_version":"1.0"},"canonical_sha256":"83c2ac92fe4fd363dbf88de1e3004ddf0cc91a0d8e390ae412f9fd7ad4a68179","source":{"kind":"arxiv","id":"1304.5932","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5932","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5932v5","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5932","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"pith_short_12","alias_value":"QPBKZEX6J7JW","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QPBKZEX6J7JWHW7Y","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QPBKZEX6","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QPBKZEX6J7JWHW7YRXQ6GACN34","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5932","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-22T12:45:15Z","cross_cats_sorted":[],"title_canon_sha256":"dcff3fcedf5d93e5285c49e62cd4f2f483264d71e87f702ad547a1533b72d3fa","abstract_canon_sha256":"db296358624d72f0b16a4183abe048235420e3123d95ca5a5e358c65d0bb0e81"},"schema_version":"1.0"},"canonical_sha256":"83c2ac92fe4fd363dbf88de1e3004ddf0cc91a0d8e390ae412f9fd7ad4a68179","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:34.359830Z","signature_b64":"WBvw+cUFHcxbV+H1v6UliegTI2e3WHWMjj0zydZdBbIGUAX5pC8NG6aJwaTunEPDnmOPIklp2MIHWTnsojQSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83c2ac92fe4fd363dbf88de1e3004ddf0cc91a0d8e390ae412f9fd7ad4a68179","last_reissued_at":"2026-05-18T02:25:34.359391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:34.359391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5932","source_version":5,"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-18T02:25:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6MKMxO4mrp+3tjCIk+9hdt3+NjlTgRwgrTfSpuSwGIHvgF/lFm5fez0e5X6DBbPiTUiO/VPOLxJ0p1qgGF+tDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:27:26.400942Z"},"content_sha256":"0704c367108e599cc60ef3dc334099f19736d103074caf9599cbb7b9a9ed76ea","schema_version":"1.0","event_id":"sha256:0704c367108e599cc60ef3dc334099f19736d103074caf9599cbb7b9a9ed76ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QPBKZEX6J7JWHW7YRXQ6GACN34","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Phase Transition of Random Non-Uniform Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elie de Panafieu","submitted_at":"2013-04-22T12:45:15Z","abstract_excerpt":"Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a parameter $\\omega_t$ of the model. It is a natural generalization of the models of graphs presented in \"The first cycles in an evolving graph\" [Flajolet, Knuth, Pittel, 1989] and in the \"Birth of the giant component\" [Janson, Knuth, \\L{}uczak, Pittel, 1993]. The present paper follows the same general approach based on analytic combinatorics. We show that man"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5932","kind":"arxiv","version":5},"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-18T02:25:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"621pkh6aG6Hs4xNAk6rIM72NS1pBUKJXbgdj84ruy2I+pR2y7Z9NMmbgB3ykkY4v7PIguRqfUTvgA7vdZu5SBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:27:26.401686Z"},"content_sha256":"05aef0143467593810316ae5cd7af181d5ccf2aec645c78a2989cba9282f4321","schema_version":"1.0","event_id":"sha256:05aef0143467593810316ae5cd7af181d5ccf2aec645c78a2989cba9282f4321"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QPBKZEX6J7JWHW7YRXQ6GACN34/bundle.json","state_url":"https://pith.science/pith/QPBKZEX6J7JWHW7YRXQ6GACN34/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QPBKZEX6J7JWHW7YRXQ6GACN34/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-10T06:27:26Z","links":{"resolver":"https://pith.science/pith/QPBKZEX6J7JWHW7YRXQ6GACN34","bundle":"https://pith.science/pith/QPBKZEX6J7JWHW7YRXQ6GACN34/bundle.json","state":"https://pith.science/pith/QPBKZEX6J7JWHW7YRXQ6GACN34/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QPBKZEX6J7JWHW7YRXQ6GACN34/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QPBKZEX6J7JWHW7YRXQ6GACN34","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":"db296358624d72f0b16a4183abe048235420e3123d95ca5a5e358c65d0bb0e81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-22T12:45:15Z","title_canon_sha256":"dcff3fcedf5d93e5285c49e62cd4f2f483264d71e87f702ad547a1533b72d3fa"},"schema_version":"1.0","source":{"id":"1304.5932","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5932","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5932v5","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5932","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"pith_short_12","alias_value":"QPBKZEX6J7JW","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QPBKZEX6J7JWHW7Y","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QPBKZEX6","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:05aef0143467593810316ae5cd7af181d5ccf2aec645c78a2989cba9282f4321","target":"graph","created_at":"2026-05-18T02:25:34Z","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":"Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a parameter $\\omega_t$ of the model. It is a natural generalization of the models of graphs presented in \"The first cycles in an evolving graph\" [Flajolet, Knuth, Pittel, 1989] and in the \"Birth of the giant component\" [Janson, Knuth, \\L{}uczak, Pittel, 1993]. The present paper follows the same general approach based on analytic combinatorics. We show that man","authors_text":"Elie de Panafieu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-22T12:45:15Z","title":"Phase Transition of Random Non-Uniform Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5932","kind":"arxiv","version":5},"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:0704c367108e599cc60ef3dc334099f19736d103074caf9599cbb7b9a9ed76ea","target":"record","created_at":"2026-05-18T02:25:34Z","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":"db296358624d72f0b16a4183abe048235420e3123d95ca5a5e358c65d0bb0e81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-22T12:45:15Z","title_canon_sha256":"dcff3fcedf5d93e5285c49e62cd4f2f483264d71e87f702ad547a1533b72d3fa"},"schema_version":"1.0","source":{"id":"1304.5932","kind":"arxiv","version":5}},"canonical_sha256":"83c2ac92fe4fd363dbf88de1e3004ddf0cc91a0d8e390ae412f9fd7ad4a68179","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83c2ac92fe4fd363dbf88de1e3004ddf0cc91a0d8e390ae412f9fd7ad4a68179","first_computed_at":"2026-05-18T02:25:34.359391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:34.359391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WBvw+cUFHcxbV+H1v6UliegTI2e3WHWMjj0zydZdBbIGUAX5pC8NG6aJwaTunEPDnmOPIklp2MIHWTnsojQSDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:34.359830Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5932","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0704c367108e599cc60ef3dc334099f19736d103074caf9599cbb7b9a9ed76ea","sha256:05aef0143467593810316ae5cd7af181d5ccf2aec645c78a2989cba9282f4321"],"state_sha256":"539355ec3bfcca195f981da303e6553e564140af0dcaebc5e5b81e3e90807456"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZLbLV5DL3uZ5YUZFNGTdr7H4uvtJN8VD4mf/GrbqDmqlmfmBrDdWuTiFNxcdu2J9/UurwoQoE50B3+m1dzOZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T06:27:26.406228Z","bundle_sha256":"bc9cbb74403f71b15e84834e5572be1d962fb14d5f0f6feb8a045bd9738c6b94"}}