{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VPRFDSQFJYZDY7KPKM64VH2LBX","short_pith_number":"pith:VPRFDSQF","canonical_record":{"source":{"id":"1403.3847","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-15T20:03:44Z","cross_cats_sorted":[],"title_canon_sha256":"c197926a26feb0152e0fbb1aa1f6c78ab618ce1ebbaec445fe7eba6d1435a4eb","abstract_canon_sha256":"011ea478ed2b924d93bd11a1d7a6999e29837168e0c424643b8c901058f7bc3c"},"schema_version":"1.0"},"canonical_sha256":"abe251ca054e323c7d4f533dca9f4b0df49873f31baf9334a964a2c0de933248","source":{"kind":"arxiv","id":"1403.3847","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3847","created_at":"2026-05-18T02:25:56Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3847v2","created_at":"2026-05-18T02:25:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3847","created_at":"2026-05-18T02:25:56Z"},{"alias_kind":"pith_short_12","alias_value":"VPRFDSQFJYZD","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VPRFDSQFJYZDY7KP","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VPRFDSQF","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VPRFDSQFJYZDY7KPKM64VH2LBX","target":"record","payload":{"canonical_record":{"source":{"id":"1403.3847","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-15T20:03:44Z","cross_cats_sorted":[],"title_canon_sha256":"c197926a26feb0152e0fbb1aa1f6c78ab618ce1ebbaec445fe7eba6d1435a4eb","abstract_canon_sha256":"011ea478ed2b924d93bd11a1d7a6999e29837168e0c424643b8c901058f7bc3c"},"schema_version":"1.0"},"canonical_sha256":"abe251ca054e323c7d4f533dca9f4b0df49873f31baf9334a964a2c0de933248","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:56.249953Z","signature_b64":"F/TGU+3wz6Dd54IoNPcYFscMLd9uMz09m4d/oA9/saLK52F+ouB57I35myz96jUdVUCA4YLGa2oDZUKsf1TJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abe251ca054e323c7d4f533dca9f4b0df49873f31baf9334a964a2c0de933248","last_reissued_at":"2026-05-18T02:25:56.249565Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:56.249565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.3847","source_version":2,"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:25:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"koc6ajLgZjncIJhXNNYzzomHVtyTNylNKdU79dVBz5BYy2Rm35HI1p+bJ35rpesCGHv/F9eZ/wbC+WhsdeIkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:44:12.388794Z"},"content_sha256":"0f729f493071b9d8dd22429e343b45333267df5a3b1067a4b25d1ae14d420798","schema_version":"1.0","event_id":"sha256:0f729f493071b9d8dd22429e343b45333267df5a3b1067a4b25d1ae14d420798"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VPRFDSQFJYZDY7KPKM64VH2LBX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A coding problem for pairs of subsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bela Bollobas, G. O. H. Katona, Ida Kantor, Imre Leader, Zoltan Furedi","submitted_at":"2014-03-15T20:03:44Z","abstract_excerpt":"Let $X$ be an $n$--element finite set, $0<k\\leq n/2$ an integer. Suppose that $\\{A_1,A_2\\} $ and $\\{B_1,B_2\\} $ are pairs of disjoint $k$-element subsets of $X$ (that is, $|A_1|=|A_2|=|B_1|=|B_2|=k$, $A_1\\cap A_2=\\emptyset$, $B_1\\cap B_2=\\emptyset$). Define the distance of these pairs by $d(\\{A_1,A_2\\} ,\\{B_1,B_2\\})=\\min \\{|A_1-B_1|+|A_2-B_2|, |A_1-B_2|+|A_2-B_1|\\} $. This is the minimum number of elements of $A_1\\cup A_2$ one has to move to obtain the other pair $\\{B_1,B_2\\}$. Let $C(n,k,d)$ be the maximum size of a family of pairs of disjoint subsets, such that the distance of any two pairs "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3847","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"},"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:25:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nOu+RSVBYWnJ9n0EyIq1WwmN21rD+8ajxe3Vmzg+hypLUeleWCQeU0CILCohjuriwnRu/Cg/ArSpthPal6smBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:44:12.389168Z"},"content_sha256":"fd340f77e39df8dfaa9080e1739201a383046493f1906a9a5d071dda11babeb3","schema_version":"1.0","event_id":"sha256:fd340f77e39df8dfaa9080e1739201a383046493f1906a9a5d071dda11babeb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VPRFDSQFJYZDY7KPKM64VH2LBX/bundle.json","state_url":"https://pith.science/pith/VPRFDSQFJYZDY7KPKM64VH2LBX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VPRFDSQFJYZDY7KPKM64VH2LBX/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-06-02T11:44:12Z","links":{"resolver":"https://pith.science/pith/VPRFDSQFJYZDY7KPKM64VH2LBX","bundle":"https://pith.science/pith/VPRFDSQFJYZDY7KPKM64VH2LBX/bundle.json","state":"https://pith.science/pith/VPRFDSQFJYZDY7KPKM64VH2LBX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VPRFDSQFJYZDY7KPKM64VH2LBX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VPRFDSQFJYZDY7KPKM64VH2LBX","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":"011ea478ed2b924d93bd11a1d7a6999e29837168e0c424643b8c901058f7bc3c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-15T20:03:44Z","title_canon_sha256":"c197926a26feb0152e0fbb1aa1f6c78ab618ce1ebbaec445fe7eba6d1435a4eb"},"schema_version":"1.0","source":{"id":"1403.3847","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3847","created_at":"2026-05-18T02:25:56Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3847v2","created_at":"2026-05-18T02:25:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3847","created_at":"2026-05-18T02:25:56Z"},{"alias_kind":"pith_short_12","alias_value":"VPRFDSQFJYZD","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VPRFDSQFJYZDY7KP","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VPRFDSQF","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:fd340f77e39df8dfaa9080e1739201a383046493f1906a9a5d071dda11babeb3","target":"graph","created_at":"2026-05-18T02:25:56Z","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":"Let $X$ be an $n$--element finite set, $0<k\\leq n/2$ an integer. Suppose that $\\{A_1,A_2\\} $ and $\\{B_1,B_2\\} $ are pairs of disjoint $k$-element subsets of $X$ (that is, $|A_1|=|A_2|=|B_1|=|B_2|=k$, $A_1\\cap A_2=\\emptyset$, $B_1\\cap B_2=\\emptyset$). Define the distance of these pairs by $d(\\{A_1,A_2\\} ,\\{B_1,B_2\\})=\\min \\{|A_1-B_1|+|A_2-B_2|, |A_1-B_2|+|A_2-B_1|\\} $. This is the minimum number of elements of $A_1\\cup A_2$ one has to move to obtain the other pair $\\{B_1,B_2\\}$. Let $C(n,k,d)$ be the maximum size of a family of pairs of disjoint subsets, such that the distance of any two pairs ","authors_text":"Bela Bollobas, G. O. H. Katona, Ida Kantor, Imre Leader, Zoltan Furedi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-15T20:03:44Z","title":"A coding problem for pairs of subsets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3847","kind":"arxiv","version":2},"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:0f729f493071b9d8dd22429e343b45333267df5a3b1067a4b25d1ae14d420798","target":"record","created_at":"2026-05-18T02:25:56Z","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":"011ea478ed2b924d93bd11a1d7a6999e29837168e0c424643b8c901058f7bc3c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-15T20:03:44Z","title_canon_sha256":"c197926a26feb0152e0fbb1aa1f6c78ab618ce1ebbaec445fe7eba6d1435a4eb"},"schema_version":"1.0","source":{"id":"1403.3847","kind":"arxiv","version":2}},"canonical_sha256":"abe251ca054e323c7d4f533dca9f4b0df49873f31baf9334a964a2c0de933248","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abe251ca054e323c7d4f533dca9f4b0df49873f31baf9334a964a2c0de933248","first_computed_at":"2026-05-18T02:25:56.249565Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:56.249565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F/TGU+3wz6Dd54IoNPcYFscMLd9uMz09m4d/oA9/saLK52F+ouB57I35myz96jUdVUCA4YLGa2oDZUKsf1TJDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:56.249953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.3847","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f729f493071b9d8dd22429e343b45333267df5a3b1067a4b25d1ae14d420798","sha256:fd340f77e39df8dfaa9080e1739201a383046493f1906a9a5d071dda11babeb3"],"state_sha256":"a0266985b4ca72c97317490d36eeb2a1a2c17327c4c4b8b4804e8f7c3356c176"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XQPzwCjThHH9gPVT+OLYVrVUtTazpuXmDryrMcJXQQObGGMsd/gfTDKAAmDKOjGvMqGwnNJzs9mjo2MxrZYGAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:44:12.391060Z","bundle_sha256":"3eb09c91f384c0ae757acb71c171f083cd2db32320290572ea4caa00d6becf19"}}