{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DDSEATCAYVGEPSOBGO4BBTUQCV","short_pith_number":"pith:DDSEATCA","schema_version":"1.0","canonical_sha256":"18e4404c40c54c47c9c133b810ce901551eec45280deb4ae51af42b4e218b057","source":{"kind":"arxiv","id":"1609.05458","version":2},"attestation_state":"computed","paper":{"title":"A note on intersecting hypergraphs with large cover number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Penny Haxell","submitted_at":"2016-09-18T09:19:22Z","abstract_excerpt":"We give a construction of r-partite r-uniform intersecting hypergraphs with cover number at least r-4 for all but finitely many r. This answers a question of Abu-Khazneh, Barat, Pokrovskiy and Szabo, and shows that a long-standing unsolved conjecture due to Ryser is close to being best possible for every value of 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":"1609.05458","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-18T09:19:22Z","cross_cats_sorted":[],"title_canon_sha256":"6d71f30d10ff082fedb5ae98a330ba2e70e7bf175d9a7521d49f79830ba2ba01","abstract_canon_sha256":"32f4bc09b530c2ab1b9d84ecb55649e801557ca7d3fa3d91f0585b8bde81294c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:36.988141Z","signature_b64":"UcHJc3v2nrWq8Gx2s3KxtBhHnP349p8CUmhN7gkUx9XqLRW0HP0trOcG7lTM6EQzxm8pspUIRw7qtnqtp1n1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18e4404c40c54c47c9c133b810ce901551eec45280deb4ae51af42b4e218b057","last_reissued_at":"2026-05-18T00:33:36.987626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:36.987626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on intersecting hypergraphs with large cover number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Penny Haxell","submitted_at":"2016-09-18T09:19:22Z","abstract_excerpt":"We give a construction of r-partite r-uniform intersecting hypergraphs with cover number at least r-4 for all but finitely many r. This answers a question of Abu-Khazneh, Barat, Pokrovskiy and Szabo, and shows that a long-standing unsolved conjecture due to Ryser is close to being best possible for every value of r."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05458","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.05458","created_at":"2026-05-18T00:33:36.987701+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.05458v2","created_at":"2026-05-18T00:33:36.987701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05458","created_at":"2026-05-18T00:33:36.987701+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDSEATCAYVGE","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDSEATCAYVGEPSOB","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDSEATCA","created_at":"2026-05-18T12:30:12.583610+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/DDSEATCAYVGEPSOBGO4BBTUQCV","json":"https://pith.science/pith/DDSEATCAYVGEPSOBGO4BBTUQCV.json","graph_json":"https://pith.science/api/pith-number/DDSEATCAYVGEPSOBGO4BBTUQCV/graph.json","events_json":"https://pith.science/api/pith-number/DDSEATCAYVGEPSOBGO4BBTUQCV/events.json","paper":"https://pith.science/paper/DDSEATCA"},"agent_actions":{"view_html":"https://pith.science/pith/DDSEATCAYVGEPSOBGO4BBTUQCV","download_json":"https://pith.science/pith/DDSEATCAYVGEPSOBGO4BBTUQCV.json","view_paper":"https://pith.science/paper/DDSEATCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.05458&json=true","fetch_graph":"https://pith.science/api/pith-number/DDSEATCAYVGEPSOBGO4BBTUQCV/graph.json","fetch_events":"https://pith.science/api/pith-number/DDSEATCAYVGEPSOBGO4BBTUQCV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDSEATCAYVGEPSOBGO4BBTUQCV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDSEATCAYVGEPSOBGO4BBTUQCV/action/storage_attestation","attest_author":"https://pith.science/pith/DDSEATCAYVGEPSOBGO4BBTUQCV/action/author_attestation","sign_citation":"https://pith.science/pith/DDSEATCAYVGEPSOBGO4BBTUQCV/action/citation_signature","submit_replication":"https://pith.science/pith/DDSEATCAYVGEPSOBGO4BBTUQCV/action/replication_record"}},"created_at":"2026-05-18T00:33:36.987701+00:00","updated_at":"2026-05-18T00:33:36.987701+00:00"}