{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KIMT6YAGEOERB7RACOMJB35VOF","short_pith_number":"pith:KIMT6YAG","schema_version":"1.0","canonical_sha256":"52193f6006238910fe20139890efb5717a421158e658a912b34c2633f5c75f2b","source":{"kind":"arxiv","id":"1605.06387","version":1},"attestation_state":"computed","paper":{"title":"Cross-intersecting pairs of hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Howard, Ron Aharoni","submitted_at":"2016-05-20T14:54:12Z","abstract_excerpt":"Two hypergraphs $H_1,\\ H_2$ are called {\\em cross-intersecting} if $e_1 \\cap e_2 \\neq \\emptyset$ for every pair of edges $e_1 \\in H_1,~e_2 \\in H_2$. Each of the hypergraphs is then said to {\\em block} the other. Given parameters $n,r,m$ we determine the maximal size of a sub-hypergraph of $[n]^r$ (meaning that it is $r$-partite, with all sides of size $n$) for which there exists a blocking sub-hypergraph of $[n]^r$ of size $m$. The answer involves a fractal-like (that is, self-similar) sequence, first studied by Knuth. We also study the same question with $\\binom{n}{r}$ replacing $[n]^r$."},"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":"1605.06387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-20T14:54:12Z","cross_cats_sorted":[],"title_canon_sha256":"2531e422c07ff6264560d973fa7c20a95879e625b6e9b2c13ec9fe56a7bf24b2","abstract_canon_sha256":"5460b5126e291373799b4441638b4717fa379faff8ef6eccf27bce8e67ddd773"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:19.028817Z","signature_b64":"cArmcFY9h0ZM9qKT6U1jX5L3+BOQNFr8lFrkgsMXqVa346eMGO/GfCk1siaCVaTi/2aa2lKP637ERDmjD5/pCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52193f6006238910fe20139890efb5717a421158e658a912b34c2633f5c75f2b","last_reissued_at":"2026-05-18T01:14:19.028123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:19.028123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cross-intersecting pairs of hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Howard, Ron Aharoni","submitted_at":"2016-05-20T14:54:12Z","abstract_excerpt":"Two hypergraphs $H_1,\\ H_2$ are called {\\em cross-intersecting} if $e_1 \\cap e_2 \\neq \\emptyset$ for every pair of edges $e_1 \\in H_1,~e_2 \\in H_2$. Each of the hypergraphs is then said to {\\em block} the other. Given parameters $n,r,m$ we determine the maximal size of a sub-hypergraph of $[n]^r$ (meaning that it is $r$-partite, with all sides of size $n$) for which there exists a blocking sub-hypergraph of $[n]^r$ of size $m$. The answer involves a fractal-like (that is, self-similar) sequence, first studied by Knuth. We also study the same question with $\\binom{n}{r}$ replacing $[n]^r$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06387","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":"1605.06387","created_at":"2026-05-18T01:14:19.028233+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.06387v1","created_at":"2026-05-18T01:14:19.028233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06387","created_at":"2026-05-18T01:14:19.028233+00:00"},{"alias_kind":"pith_short_12","alias_value":"KIMT6YAGEOER","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KIMT6YAGEOERB7RA","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KIMT6YAG","created_at":"2026-05-18T12:30:25.849896+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/KIMT6YAGEOERB7RACOMJB35VOF","json":"https://pith.science/pith/KIMT6YAGEOERB7RACOMJB35VOF.json","graph_json":"https://pith.science/api/pith-number/KIMT6YAGEOERB7RACOMJB35VOF/graph.json","events_json":"https://pith.science/api/pith-number/KIMT6YAGEOERB7RACOMJB35VOF/events.json","paper":"https://pith.science/paper/KIMT6YAG"},"agent_actions":{"view_html":"https://pith.science/pith/KIMT6YAGEOERB7RACOMJB35VOF","download_json":"https://pith.science/pith/KIMT6YAGEOERB7RACOMJB35VOF.json","view_paper":"https://pith.science/paper/KIMT6YAG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.06387&json=true","fetch_graph":"https://pith.science/api/pith-number/KIMT6YAGEOERB7RACOMJB35VOF/graph.json","fetch_events":"https://pith.science/api/pith-number/KIMT6YAGEOERB7RACOMJB35VOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KIMT6YAGEOERB7RACOMJB35VOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KIMT6YAGEOERB7RACOMJB35VOF/action/storage_attestation","attest_author":"https://pith.science/pith/KIMT6YAGEOERB7RACOMJB35VOF/action/author_attestation","sign_citation":"https://pith.science/pith/KIMT6YAGEOERB7RACOMJB35VOF/action/citation_signature","submit_replication":"https://pith.science/pith/KIMT6YAGEOERB7RACOMJB35VOF/action/replication_record"}},"created_at":"2026-05-18T01:14:19.028233+00:00","updated_at":"2026-05-18T01:14:19.028233+00:00"}