{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2CF6ZRKR5OAD7BXTFPI7BOVJS7","short_pith_number":"pith:2CF6ZRKR","schema_version":"1.0","canonical_sha256":"d08becc551eb803f86f32bd1f0baa997da31ac614dda3571589d301ef186d186","source":{"kind":"arxiv","id":"1409.4610","version":1},"attestation_state":"computed","paper":{"title":"A note on uniform intersecting families with maximum transversal size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amit Tripathi","submitted_at":"2014-09-16T12:42:37Z","abstract_excerpt":"We construct an intersecting $k$-family of transversal size $\\lceil \\frac{k+1}{2} \\rceil$ and length $k+1$ and study some of its properties. We use this family to prove that $q(4) = 9$. We also construct a $k$-family for $k = 2^m - 1$ of length $2k+1$ and transversal size at least $(2k+1)/3$."},"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":"1409.4610","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-16T12:42:37Z","cross_cats_sorted":[],"title_canon_sha256":"257347cd23d440b9b35de401f27700c16baf34859fdba2b806ce6028ba074665","abstract_canon_sha256":"d64460ce46892819123a6fa59e89e44c2a96ceb423302aa56158fc1aa27187e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:45.245867Z","signature_b64":"R/ig2iEsUswEsAQ1vP4Q3/lSI66V70SSUoD2gi7jSAHdXblf0RdKcVaW3XzOiCbA06Dl+x3R0DgCXhUsLqShBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d08becc551eb803f86f32bd1f0baa997da31ac614dda3571589d301ef186d186","last_reissued_at":"2026-05-18T02:42:45.245280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:45.245280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on uniform intersecting families with maximum transversal size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amit Tripathi","submitted_at":"2014-09-16T12:42:37Z","abstract_excerpt":"We construct an intersecting $k$-family of transversal size $\\lceil \\frac{k+1}{2} \\rceil$ and length $k+1$ and study some of its properties. We use this family to prove that $q(4) = 9$. We also construct a $k$-family for $k = 2^m - 1$ of length $2k+1$ and transversal size at least $(2k+1)/3$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4610","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":"1409.4610","created_at":"2026-05-18T02:42:45.245384+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.4610v1","created_at":"2026-05-18T02:42:45.245384+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4610","created_at":"2026-05-18T02:42:45.245384+00:00"},{"alias_kind":"pith_short_12","alias_value":"2CF6ZRKR5OAD","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"2CF6ZRKR5OAD7BXT","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"2CF6ZRKR","created_at":"2026-05-18T12:28:09.283467+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.24878","citing_title":"An Improved Lower Bound for the Erd\\H{o}s-Lov\\'asz Cover Number Problem","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2CF6ZRKR5OAD7BXTFPI7BOVJS7","json":"https://pith.science/pith/2CF6ZRKR5OAD7BXTFPI7BOVJS7.json","graph_json":"https://pith.science/api/pith-number/2CF6ZRKR5OAD7BXTFPI7BOVJS7/graph.json","events_json":"https://pith.science/api/pith-number/2CF6ZRKR5OAD7BXTFPI7BOVJS7/events.json","paper":"https://pith.science/paper/2CF6ZRKR"},"agent_actions":{"view_html":"https://pith.science/pith/2CF6ZRKR5OAD7BXTFPI7BOVJS7","download_json":"https://pith.science/pith/2CF6ZRKR5OAD7BXTFPI7BOVJS7.json","view_paper":"https://pith.science/paper/2CF6ZRKR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.4610&json=true","fetch_graph":"https://pith.science/api/pith-number/2CF6ZRKR5OAD7BXTFPI7BOVJS7/graph.json","fetch_events":"https://pith.science/api/pith-number/2CF6ZRKR5OAD7BXTFPI7BOVJS7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2CF6ZRKR5OAD7BXTFPI7BOVJS7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2CF6ZRKR5OAD7BXTFPI7BOVJS7/action/storage_attestation","attest_author":"https://pith.science/pith/2CF6ZRKR5OAD7BXTFPI7BOVJS7/action/author_attestation","sign_citation":"https://pith.science/pith/2CF6ZRKR5OAD7BXTFPI7BOVJS7/action/citation_signature","submit_replication":"https://pith.science/pith/2CF6ZRKR5OAD7BXTFPI7BOVJS7/action/replication_record"}},"created_at":"2026-05-18T02:42:45.245384+00:00","updated_at":"2026-05-18T02:42:45.245384+00:00"}