{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:I7MYIJATNBZBWTL4COGPQWAZ3A","short_pith_number":"pith:I7MYIJAT","schema_version":"1.0","canonical_sha256":"47d984241368721b4d7c138cf85819d80da7c710082dcb380e49cc1c4a37deab","source":{"kind":"arxiv","id":"1408.6348","version":1},"attestation_state":"computed","paper":{"title":"Intersections of hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, B\\'ela Bollob\\'as","submitted_at":"2014-08-27T08:45:28Z","abstract_excerpt":"Given two weighted k-uniform hypergraphs G, H of order n, how much (or little) can we make them overlap by placing them on the same vertex set? If we place them at random, how concentrated is the distribution of the intersection? The aim of this paper is to investigate these questions."},"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":"1408.6348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-27T08:45:28Z","cross_cats_sorted":[],"title_canon_sha256":"3f9d9db5bfd2748ebc033d019504f761f2c34a5f244eb1786b7c149ca07e8445","abstract_canon_sha256":"b4f185c685cee5b8f52169de84f9758ee8b4a0c55be47f461aab9c7c1734520c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:07.690777Z","signature_b64":"ZZaUriAWu7TjBTgVZNP1lQtM/oEHr1n2JGmMuYJ/gqVQL1q+Z5kXXfoGTmrQ2Th5CN5Mickcn1InODyz/iCqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47d984241368721b4d7c138cf85819d80da7c710082dcb380e49cc1c4a37deab","last_reissued_at":"2026-05-18T02:44:07.690171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:07.690171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intersections of hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, B\\'ela Bollob\\'as","submitted_at":"2014-08-27T08:45:28Z","abstract_excerpt":"Given two weighted k-uniform hypergraphs G, H of order n, how much (or little) can we make them overlap by placing them on the same vertex set? If we place them at random, how concentrated is the distribution of the intersection? The aim of this paper is to investigate these questions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6348","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":"1408.6348","created_at":"2026-05-18T02:44:07.690255+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.6348v1","created_at":"2026-05-18T02:44:07.690255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6348","created_at":"2026-05-18T02:44:07.690255+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7MYIJATNBZB","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7MYIJATNBZBWTL4","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7MYIJAT","created_at":"2026-05-18T12:28:33.132498+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/I7MYIJATNBZBWTL4COGPQWAZ3A","json":"https://pith.science/pith/I7MYIJATNBZBWTL4COGPQWAZ3A.json","graph_json":"https://pith.science/api/pith-number/I7MYIJATNBZBWTL4COGPQWAZ3A/graph.json","events_json":"https://pith.science/api/pith-number/I7MYIJATNBZBWTL4COGPQWAZ3A/events.json","paper":"https://pith.science/paper/I7MYIJAT"},"agent_actions":{"view_html":"https://pith.science/pith/I7MYIJATNBZBWTL4COGPQWAZ3A","download_json":"https://pith.science/pith/I7MYIJATNBZBWTL4COGPQWAZ3A.json","view_paper":"https://pith.science/paper/I7MYIJAT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.6348&json=true","fetch_graph":"https://pith.science/api/pith-number/I7MYIJATNBZBWTL4COGPQWAZ3A/graph.json","fetch_events":"https://pith.science/api/pith-number/I7MYIJATNBZBWTL4COGPQWAZ3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7MYIJATNBZBWTL4COGPQWAZ3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7MYIJATNBZBWTL4COGPQWAZ3A/action/storage_attestation","attest_author":"https://pith.science/pith/I7MYIJATNBZBWTL4COGPQWAZ3A/action/author_attestation","sign_citation":"https://pith.science/pith/I7MYIJATNBZBWTL4COGPQWAZ3A/action/citation_signature","submit_replication":"https://pith.science/pith/I7MYIJATNBZBWTL4COGPQWAZ3A/action/replication_record"}},"created_at":"2026-05-18T02:44:07.690255+00:00","updated_at":"2026-05-18T02:44:07.690255+00:00"}