{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:M4UGRNGAWRRL75EZ2YZ56IF6BV","short_pith_number":"pith:M4UGRNGA","schema_version":"1.0","canonical_sha256":"672868b4c0b462bff499d633df20be0d4aee39c5a01a8ca2d0b1a45d032b98ef","source":{"kind":"arxiv","id":"1402.2471","version":3},"attestation_state":"computed","paper":{"title":"$K_{s,t}$-saturated bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, D\\'aniel Kor\\'andi, Wenying Gan","submitted_at":"2014-02-11T12:21:42Z","abstract_excerpt":"An $n$-by-$n$ bipartite graph is $H$-saturated if the addition of any missing edge between its two parts creates a new copy of $H$. In 1964, Erd\\H{o}s, Hajnal and Moon made a conjecture on the minimum number of edges in a $K_{s,s}$-saturated bipartite graph. This conjecture was proved independently by Wessel and Bollob\\'as in a more general, but ordered, setting: they showed that the minimum number of edges in a $K_{(s,t)}$-saturated bipartite graph is $n^2-(n-s+1)(n-t+1)$, where $K_{(s,t)}$ is the \"ordered\" complete bipartite graph with $s$ vertices in the first color class and $t$ vertices i"},"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":"1402.2471","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-11T12:21:42Z","cross_cats_sorted":[],"title_canon_sha256":"b81329786d8e21dd63eab12f8e4bdf3202adfed34b1e9dc2454305935b7411e5","abstract_canon_sha256":"feb0b64048bcbc8a3cf3248cd80adc4d4162caad3075aff4d2628c239a39dee3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:46.267051Z","signature_b64":"Fngs5AAhSul/4LO+RIOlt+ecqWyoGKMIA0E2QLTUtAOBu7r0M0Sv6iUCa4qbW5r3C7AV4gQmfZwToMh7s71zBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"672868b4c0b462bff499d633df20be0d4aee39c5a01a8ca2d0b1a45d032b98ef","last_reissued_at":"2026-05-18T02:32:46.266572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:46.266572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$K_{s,t}$-saturated bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, D\\'aniel Kor\\'andi, Wenying Gan","submitted_at":"2014-02-11T12:21:42Z","abstract_excerpt":"An $n$-by-$n$ bipartite graph is $H$-saturated if the addition of any missing edge between its two parts creates a new copy of $H$. In 1964, Erd\\H{o}s, Hajnal and Moon made a conjecture on the minimum number of edges in a $K_{s,s}$-saturated bipartite graph. This conjecture was proved independently by Wessel and Bollob\\'as in a more general, but ordered, setting: they showed that the minimum number of edges in a $K_{(s,t)}$-saturated bipartite graph is $n^2-(n-s+1)(n-t+1)$, where $K_{(s,t)}$ is the \"ordered\" complete bipartite graph with $s$ vertices in the first color class and $t$ vertices i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2471","kind":"arxiv","version":3},"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":"1402.2471","created_at":"2026-05-18T02:32:46.266654+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2471v3","created_at":"2026-05-18T02:32:46.266654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2471","created_at":"2026-05-18T02:32:46.266654+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4UGRNGAWRRL","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4UGRNGAWRRL75EZ","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4UGRNGA","created_at":"2026-05-18T12:28:38.356838+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/M4UGRNGAWRRL75EZ2YZ56IF6BV","json":"https://pith.science/pith/M4UGRNGAWRRL75EZ2YZ56IF6BV.json","graph_json":"https://pith.science/api/pith-number/M4UGRNGAWRRL75EZ2YZ56IF6BV/graph.json","events_json":"https://pith.science/api/pith-number/M4UGRNGAWRRL75EZ2YZ56IF6BV/events.json","paper":"https://pith.science/paper/M4UGRNGA"},"agent_actions":{"view_html":"https://pith.science/pith/M4UGRNGAWRRL75EZ2YZ56IF6BV","download_json":"https://pith.science/pith/M4UGRNGAWRRL75EZ2YZ56IF6BV.json","view_paper":"https://pith.science/paper/M4UGRNGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2471&json=true","fetch_graph":"https://pith.science/api/pith-number/M4UGRNGAWRRL75EZ2YZ56IF6BV/graph.json","fetch_events":"https://pith.science/api/pith-number/M4UGRNGAWRRL75EZ2YZ56IF6BV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4UGRNGAWRRL75EZ2YZ56IF6BV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4UGRNGAWRRL75EZ2YZ56IF6BV/action/storage_attestation","attest_author":"https://pith.science/pith/M4UGRNGAWRRL75EZ2YZ56IF6BV/action/author_attestation","sign_citation":"https://pith.science/pith/M4UGRNGAWRRL75EZ2YZ56IF6BV/action/citation_signature","submit_replication":"https://pith.science/pith/M4UGRNGAWRRL75EZ2YZ56IF6BV/action/replication_record"}},"created_at":"2026-05-18T02:32:46.266654+00:00","updated_at":"2026-05-18T02:32:46.266654+00:00"}