{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:M4UGRNGAWRRL75EZ2YZ56IF6BV","short_pith_number":"pith:M4UGRNGA","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"},"canonical_sha256":"672868b4c0b462bff499d633df20be0d4aee39c5a01a8ca2d0b1a45d032b98ef","source":{"kind":"arxiv","id":"1402.2471","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2471","created_at":"2026-05-18T02:32:46Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2471v3","created_at":"2026-05-18T02:32:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2471","created_at":"2026-05-18T02:32:46Z"},{"alias_kind":"pith_short_12","alias_value":"M4UGRNGAWRRL","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"M4UGRNGAWRRL75EZ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"M4UGRNGA","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:M4UGRNGAWRRL75EZ2YZ56IF6BV","target":"record","payload":{"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"},"canonical_sha256":"672868b4c0b462bff499d633df20be0d4aee39c5a01a8ca2d0b1a45d032b98ef","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"},"source_kind":"arxiv","source_id":"1402.2471","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:32:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0PJBbbF67FfvlTgk+fAR2xdQ0czBTVEPacbL71Z60VkaAL5vFbxqAdOeuQsGl6hYT5mxMdKfDzlf7E+8Q5HcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:04:52.575488Z"},"content_sha256":"f7ee18bd49b251df4454a613b6f9d457aea2df82b888b4768787be9d101eb013","schema_version":"1.0","event_id":"sha256:f7ee18bd49b251df4454a613b6f9d457aea2df82b888b4768787be9d101eb013"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:M4UGRNGAWRRL75EZ2YZ56IF6BV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:32:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CMgI3E9RohsRNb7npKQrBh4AphKG8XupZxluppkXKEPUYB4bsiDqZUvtOk6p1QOcN9HVyv8/UJibWoe8TNKhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:04:52.576184Z"},"content_sha256":"ec3644c74cce8ec03570ed7db5020f5e0c2056fa9b0fcdd1fdb221f3ed4dfee2","schema_version":"1.0","event_id":"sha256:ec3644c74cce8ec03570ed7db5020f5e0c2056fa9b0fcdd1fdb221f3ed4dfee2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M4UGRNGAWRRL75EZ2YZ56IF6BV/bundle.json","state_url":"https://pith.science/pith/M4UGRNGAWRRL75EZ2YZ56IF6BV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M4UGRNGAWRRL75EZ2YZ56IF6BV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T00:04:52Z","links":{"resolver":"https://pith.science/pith/M4UGRNGAWRRL75EZ2YZ56IF6BV","bundle":"https://pith.science/pith/M4UGRNGAWRRL75EZ2YZ56IF6BV/bundle.json","state":"https://pith.science/pith/M4UGRNGAWRRL75EZ2YZ56IF6BV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M4UGRNGAWRRL75EZ2YZ56IF6BV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:M4UGRNGAWRRL75EZ2YZ56IF6BV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"feb0b64048bcbc8a3cf3248cd80adc4d4162caad3075aff4d2628c239a39dee3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-11T12:21:42Z","title_canon_sha256":"b81329786d8e21dd63eab12f8e4bdf3202adfed34b1e9dc2454305935b7411e5"},"schema_version":"1.0","source":{"id":"1402.2471","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2471","created_at":"2026-05-18T02:32:46Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2471v3","created_at":"2026-05-18T02:32:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2471","created_at":"2026-05-18T02:32:46Z"},{"alias_kind":"pith_short_12","alias_value":"M4UGRNGAWRRL","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"M4UGRNGAWRRL75EZ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"M4UGRNGA","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:ec3644c74cce8ec03570ed7db5020f5e0c2056fa9b0fcdd1fdb221f3ed4dfee2","target":"graph","created_at":"2026-05-18T02:32:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Benny Sudakov, D\\'aniel Kor\\'andi, Wenying Gan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-11T12:21:42Z","title":"$K_{s,t}$-saturated bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2471","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f7ee18bd49b251df4454a613b6f9d457aea2df82b888b4768787be9d101eb013","target":"record","created_at":"2026-05-18T02:32:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"feb0b64048bcbc8a3cf3248cd80adc4d4162caad3075aff4d2628c239a39dee3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-11T12:21:42Z","title_canon_sha256":"b81329786d8e21dd63eab12f8e4bdf3202adfed34b1e9dc2454305935b7411e5"},"schema_version":"1.0","source":{"id":"1402.2471","kind":"arxiv","version":3}},"canonical_sha256":"672868b4c0b462bff499d633df20be0d4aee39c5a01a8ca2d0b1a45d032b98ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"672868b4c0b462bff499d633df20be0d4aee39c5a01a8ca2d0b1a45d032b98ef","first_computed_at":"2026-05-18T02:32:46.266572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:46.266572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fngs5AAhSul/4LO+RIOlt+ecqWyoGKMIA0E2QLTUtAOBu7r0M0Sv6iUCa4qbW5r3C7AV4gQmfZwToMh7s71zBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:46.267051Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2471","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7ee18bd49b251df4454a613b6f9d457aea2df82b888b4768787be9d101eb013","sha256:ec3644c74cce8ec03570ed7db5020f5e0c2056fa9b0fcdd1fdb221f3ed4dfee2"],"state_sha256":"6a50129e6c460ad648bef174f7dbf14b087a4fd140b0a3e207e9c0c3238b0573"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HpYShPoH4iU4dmX/MfE1BvTHlceIhcW331FYfyMeQ9sXkL63ifTi8COSP5jJFSxTJokDyhCf67f9bdPAYOcqBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:04:52.579758Z","bundle_sha256":"a1fa22df9ca51f34e82ff3d4c94eced4165b74ecd73216b9faaa879fd3b84b60"}}