{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FKH3ZWBWYMMSXJT7R2JOLMUWLC","short_pith_number":"pith:FKH3ZWBW","canonical_record":{"source":{"id":"1703.07686","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2017-03-22T14:47:37Z","cross_cats_sorted":[],"title_canon_sha256":"ec7f3f54244b8b9022080d40716072a3f45d2f60b3db617e7d21e3ce97188540","abstract_canon_sha256":"b92bf68ca46393bd03ad964cfb159c4f4b91fa6ac9149b1360e35a0cb00e5f75"},"schema_version":"1.0"},"canonical_sha256":"2a8fbcd836c3192ba67f8e92e5b2965881028ba91b90204268aaac801c34491d","source":{"kind":"arxiv","id":"1703.07686","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07686","created_at":"2026-05-18T00:21:05Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07686v2","created_at":"2026-05-18T00:21:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07686","created_at":"2026-05-18T00:21:05Z"},{"alias_kind":"pith_short_12","alias_value":"FKH3ZWBWYMMS","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FKH3ZWBWYMMSXJT7","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FKH3ZWBW","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FKH3ZWBWYMMSXJT7R2JOLMUWLC","target":"record","payload":{"canonical_record":{"source":{"id":"1703.07686","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2017-03-22T14:47:37Z","cross_cats_sorted":[],"title_canon_sha256":"ec7f3f54244b8b9022080d40716072a3f45d2f60b3db617e7d21e3ce97188540","abstract_canon_sha256":"b92bf68ca46393bd03ad964cfb159c4f4b91fa6ac9149b1360e35a0cb00e5f75"},"schema_version":"1.0"},"canonical_sha256":"2a8fbcd836c3192ba67f8e92e5b2965881028ba91b90204268aaac801c34491d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:05.021699Z","signature_b64":"2bKoFXlh2kwBBDC515B4PHCI0XMV+arZjuWixsGrFn31HrYJF3+lctVDkiql9pGQc/ad1cHGeKjMRrmYV0l0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a8fbcd836c3192ba67f8e92e5b2965881028ba91b90204268aaac801c34491d","last_reissued_at":"2026-05-18T00:21:05.021101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:05.021101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.07686","source_version":2,"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-18T00:21:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k//TP78LbmEcMIr/6n3u3e/rJIeEsSoNBkKTz8HHvxZXbBAZivFjaMAzWpvnVtbHjmMn7uURWkev8fCcqNffCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:31:19.838659Z"},"content_sha256":"f1ac0bd3c27606e0b677de6787752c56537630dece944a8cba952e06d5da505a","schema_version":"1.0","event_id":"sha256:f1ac0bd3c27606e0b677de6787752c56537630dece944a8cba952e06d5da505a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FKH3ZWBWYMMSXJT7R2JOLMUWLC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subhypergraphs in non-uniform random hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Reiniger, John Healy, John Proos, Kirill Ternovsky, Megan Dewar, Pawe{\\l} Pra{\\l}at, Xavier P\\'erez-Gim\\'enez","submitted_at":"2017-03-22T14:47:37Z","abstract_excerpt":"In this paper we focus on the problem of finding (small) subhypergraphs in a (large) hypergraph. We use this problem to illustrate that reducing hypergraph problems to graph problems by working with the 2-section is not always a reasonable approach. We begin by defining a generalization of the binomial random graph model to hypergraphs and formalizing several definitions of subhypergraph. The bulk of the paper focusses on determining the expected existence of these types of subhypergraph in random hypergraphs. We also touch on the problem of determining whether a given subgraph appearing in th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07686","kind":"arxiv","version":2},"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-18T00:21:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8DVLjqQloV3gOqkrC/szwT57mQ9pPabL+yEf4vtKehN++yoVuVKVK0spvCb1/vXudtbxQfgz48ldF81Sr55WCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:31:19.839011Z"},"content_sha256":"757354091640643d9c0f51477d57e7a22a0d09bbe28899653710da2e17d5626a","schema_version":"1.0","event_id":"sha256:757354091640643d9c0f51477d57e7a22a0d09bbe28899653710da2e17d5626a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FKH3ZWBWYMMSXJT7R2JOLMUWLC/bundle.json","state_url":"https://pith.science/pith/FKH3ZWBWYMMSXJT7R2JOLMUWLC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FKH3ZWBWYMMSXJT7R2JOLMUWLC/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-02T19:31:19Z","links":{"resolver":"https://pith.science/pith/FKH3ZWBWYMMSXJT7R2JOLMUWLC","bundle":"https://pith.science/pith/FKH3ZWBWYMMSXJT7R2JOLMUWLC/bundle.json","state":"https://pith.science/pith/FKH3ZWBWYMMSXJT7R2JOLMUWLC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FKH3ZWBWYMMSXJT7R2JOLMUWLC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FKH3ZWBWYMMSXJT7R2JOLMUWLC","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":"b92bf68ca46393bd03ad964cfb159c4f4b91fa6ac9149b1360e35a0cb00e5f75","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2017-03-22T14:47:37Z","title_canon_sha256":"ec7f3f54244b8b9022080d40716072a3f45d2f60b3db617e7d21e3ce97188540"},"schema_version":"1.0","source":{"id":"1703.07686","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07686","created_at":"2026-05-18T00:21:05Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07686v2","created_at":"2026-05-18T00:21:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07686","created_at":"2026-05-18T00:21:05Z"},{"alias_kind":"pith_short_12","alias_value":"FKH3ZWBWYMMS","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FKH3ZWBWYMMSXJT7","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FKH3ZWBW","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:757354091640643d9c0f51477d57e7a22a0d09bbe28899653710da2e17d5626a","target":"graph","created_at":"2026-05-18T00:21:05Z","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":"In this paper we focus on the problem of finding (small) subhypergraphs in a (large) hypergraph. We use this problem to illustrate that reducing hypergraph problems to graph problems by working with the 2-section is not always a reasonable approach. We begin by defining a generalization of the binomial random graph model to hypergraphs and formalizing several definitions of subhypergraph. The bulk of the paper focusses on determining the expected existence of these types of subhypergraph in random hypergraphs. We also touch on the problem of determining whether a given subgraph appearing in th","authors_text":"Benjamin Reiniger, John Healy, John Proos, Kirill Ternovsky, Megan Dewar, Pawe{\\l} Pra{\\l}at, Xavier P\\'erez-Gim\\'enez","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2017-03-22T14:47:37Z","title":"Subhypergraphs in non-uniform random hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07686","kind":"arxiv","version":2},"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:f1ac0bd3c27606e0b677de6787752c56537630dece944a8cba952e06d5da505a","target":"record","created_at":"2026-05-18T00:21:05Z","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":"b92bf68ca46393bd03ad964cfb159c4f4b91fa6ac9149b1360e35a0cb00e5f75","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2017-03-22T14:47:37Z","title_canon_sha256":"ec7f3f54244b8b9022080d40716072a3f45d2f60b3db617e7d21e3ce97188540"},"schema_version":"1.0","source":{"id":"1703.07686","kind":"arxiv","version":2}},"canonical_sha256":"2a8fbcd836c3192ba67f8e92e5b2965881028ba91b90204268aaac801c34491d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a8fbcd836c3192ba67f8e92e5b2965881028ba91b90204268aaac801c34491d","first_computed_at":"2026-05-18T00:21:05.021101Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:05.021101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2bKoFXlh2kwBBDC515B4PHCI0XMV+arZjuWixsGrFn31HrYJF3+lctVDkiql9pGQc/ad1cHGeKjMRrmYV0l0Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:05.021699Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.07686","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1ac0bd3c27606e0b677de6787752c56537630dece944a8cba952e06d5da505a","sha256:757354091640643d9c0f51477d57e7a22a0d09bbe28899653710da2e17d5626a"],"state_sha256":"211b4ca6f7f50dec94abae67806a3ee8aa17dda06d209b5e0bb89371f3c327c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QFUX3fJhqfqbQiYl6W/KDAlIGELNBTE4WPBkrYcvb6wudueijKZLudG7T7tP4LEoo2yZH6YME0G4QYut6GrrCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:31:19.840994Z","bundle_sha256":"f8067ae236a689f670f0f0ec4dadfed805f8e144dbf772c6deff8816104dc1fc"}}