{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:72A4PAGYT7IXNATDDGAX4QRICF","short_pith_number":"pith:72A4PAGY","schema_version":"1.0","canonical_sha256":"fe81c780d89fd176826319817e4228116064c61ff1841cb4762636d7268fb86b","source":{"kind":"arxiv","id":"1201.1377","version":2},"attestation_state":"computed","paper":{"title":"On Zarankiewicz Problem and Depth-Two Superconcentrators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Chinmoy Dutta, Jaikumar Radhakrishnan","submitted_at":"2012-01-06T09:15:07Z","abstract_excerpt":"We show tight necessary and sufficient conditions on the sizes of small bipartite graphs whose union is a larger bipartite graph that has no large bipartite independent set. Our main result is a common generalization of two classical results in graph theory: the theorem of K\\H{o}v\\'{a}ri, S\\'{o}s and Tur\\'{a}n on the minimum number of edges in a bipartite graph that has no large independent set, and the theorem of Hansel (also Katona and Szemer\\'{e}di, Krichevskii) on the sum of the sizes of bipartite graphs that can be used to construct a graph (non-necessarily bipartite) that has no large in"},"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":"1201.1377","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-01-06T09:15:07Z","cross_cats_sorted":[],"title_canon_sha256":"d4ea3238dd53f2ed92db95fc3ccf02da5f548eedccbc87268ef302d6186c3e6b","abstract_canon_sha256":"4aed7882a591fd54672f479be43d6bb22c7cf73e6c26d94ee5e54685db693aef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:01.316819Z","signature_b64":"9wJ1KHRQhhedxL9513A7zDFQq3gjvpCF6p9CVDUQ5PS0sKIzx3KUI0dBEbA2S/K7kAhFae3zCXPuz+CprdgWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe81c780d89fd176826319817e4228116064c61ff1841cb4762636d7268fb86b","last_reissued_at":"2026-05-18T02:26:01.316354Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:01.316354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Zarankiewicz Problem and Depth-Two Superconcentrators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Chinmoy Dutta, Jaikumar Radhakrishnan","submitted_at":"2012-01-06T09:15:07Z","abstract_excerpt":"We show tight necessary and sufficient conditions on the sizes of small bipartite graphs whose union is a larger bipartite graph that has no large bipartite independent set. Our main result is a common generalization of two classical results in graph theory: the theorem of K\\H{o}v\\'{a}ri, S\\'{o}s and Tur\\'{a}n on the minimum number of edges in a bipartite graph that has no large independent set, and the theorem of Hansel (also Katona and Szemer\\'{e}di, Krichevskii) on the sum of the sizes of bipartite graphs that can be used to construct a graph (non-necessarily bipartite) that has no large in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1377","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":"1201.1377","created_at":"2026-05-18T02:26:01.316421+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.1377v2","created_at":"2026-05-18T02:26:01.316421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1377","created_at":"2026-05-18T02:26:01.316421+00:00"},{"alias_kind":"pith_short_12","alias_value":"72A4PAGYT7IX","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"72A4PAGYT7IXNATD","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"72A4PAGY","created_at":"2026-05-18T12:26:56.085431+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/72A4PAGYT7IXNATDDGAX4QRICF","json":"https://pith.science/pith/72A4PAGYT7IXNATDDGAX4QRICF.json","graph_json":"https://pith.science/api/pith-number/72A4PAGYT7IXNATDDGAX4QRICF/graph.json","events_json":"https://pith.science/api/pith-number/72A4PAGYT7IXNATDDGAX4QRICF/events.json","paper":"https://pith.science/paper/72A4PAGY"},"agent_actions":{"view_html":"https://pith.science/pith/72A4PAGYT7IXNATDDGAX4QRICF","download_json":"https://pith.science/pith/72A4PAGYT7IXNATDDGAX4QRICF.json","view_paper":"https://pith.science/paper/72A4PAGY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.1377&json=true","fetch_graph":"https://pith.science/api/pith-number/72A4PAGYT7IXNATDDGAX4QRICF/graph.json","fetch_events":"https://pith.science/api/pith-number/72A4PAGYT7IXNATDDGAX4QRICF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/72A4PAGYT7IXNATDDGAX4QRICF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/72A4PAGYT7IXNATDDGAX4QRICF/action/storage_attestation","attest_author":"https://pith.science/pith/72A4PAGYT7IXNATDDGAX4QRICF/action/author_attestation","sign_citation":"https://pith.science/pith/72A4PAGYT7IXNATDDGAX4QRICF/action/citation_signature","submit_replication":"https://pith.science/pith/72A4PAGYT7IXNATDDGAX4QRICF/action/replication_record"}},"created_at":"2026-05-18T02:26:01.316421+00:00","updated_at":"2026-05-18T02:26:01.316421+00:00"}