{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QDQMJK4NMZPVZ4D7JMNLJKKDZY","short_pith_number":"pith:QDQMJK4N","canonical_record":{"source":{"id":"1201.2551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-01-12T12:51:45Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"77f140c0d754c08223193b26f7304e64f7611be0ed7db5dfc565af58449376bc","abstract_canon_sha256":"b6b7fb45c1bf502d5b0c19497d28a5c9fb54e5c5125dfaa1fe8c04a48ef1bc6c"},"schema_version":"1.0"},"canonical_sha256":"80e0c4ab8d665f5cf07f4b1ab4a943ce367ed4d8fe8526d55b3ed5db93dfad4a","source":{"kind":"arxiv","id":"1201.2551","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2551","created_at":"2026-05-18T04:04:44Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2551v1","created_at":"2026-05-18T04:04:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2551","created_at":"2026-05-18T04:04:44Z"},{"alias_kind":"pith_short_12","alias_value":"QDQMJK4NMZPV","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QDQMJK4NMZPVZ4D7","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QDQMJK4N","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QDQMJK4NMZPVZ4D7JMNLJKKDZY","target":"record","payload":{"canonical_record":{"source":{"id":"1201.2551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-01-12T12:51:45Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"77f140c0d754c08223193b26f7304e64f7611be0ed7db5dfc565af58449376bc","abstract_canon_sha256":"b6b7fb45c1bf502d5b0c19497d28a5c9fb54e5c5125dfaa1fe8c04a48ef1bc6c"},"schema_version":"1.0"},"canonical_sha256":"80e0c4ab8d665f5cf07f4b1ab4a943ce367ed4d8fe8526d55b3ed5db93dfad4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:44.172109Z","signature_b64":"QQVzgEVXilccQtsiFZg6CBWlj5kiaUWYPxL9sNIiDQMG4a76kZHfvXifi+Awb9AX3DMv5f5q89jtnqPpEqmNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80e0c4ab8d665f5cf07f4b1ab4a943ce367ed4d8fe8526d55b3ed5db93dfad4a","last_reissued_at":"2026-05-18T04:04:44.171647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:44.171647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.2551","source_version":1,"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-18T04:04:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lptQG36BmWHAMOb9/lUThoiU53YReWlu7GwUNyRgBb+p99uTD0D5LbtU9+TVRjtfUGzrbSSi+kYBsadSzoJ8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:00:02.674396Z"},"content_sha256":"b511a052f4284b7f12703e6e11fc8d6f649e9a62e002bba9429ce1f328a6cf86","schema_version":"1.0","event_id":"sha256:b511a052f4284b7f12703e6e11fc8d6f649e9a62e002bba9429ce1f328a6cf86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QDQMJK4NMZPVZ4D7JMNLJKKDZY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fork-forests in bi-colored complete bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Georg Osang, Ignaz Rutter, Marcus Krug, Maria Axenovich","submitted_at":"2012-01-12T12:51:45Z","abstract_excerpt":"Motivated by the problem in [6], which studies the relative efficiency of propositional proof systems, 2-edge colorings of complete bipartite graphs are investigated. It is shown that if the edges of $G=K_{n,n}$ are colored with black and white such that the number of black edges differs from the number of white edges by at most 1, then there are at least $n(1-1/\\sqrt{2})$ vertex-disjoint forks with centers in the same partite set of $G$. Here, a fork is a graph formed by two adjacent edges of different colors. The bound is sharp. Moreover, an algorithm running in time $O(n^2 \\log n \\sqrt{n \\a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2551","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"},"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-18T04:04:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8kX4apYGDINyvJ1yij792e0Oa8O5/dt5+v0hcvDcCaBFwe1IQ3sU8+KE2/1/ADJrZDJr1maufofTkb7L908vBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:00:02.674766Z"},"content_sha256":"33d2d6a2722b3d22e81cb3bca7a61c48c6116f5922eb3334081cd934322243e5","schema_version":"1.0","event_id":"sha256:33d2d6a2722b3d22e81cb3bca7a61c48c6116f5922eb3334081cd934322243e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QDQMJK4NMZPVZ4D7JMNLJKKDZY/bundle.json","state_url":"https://pith.science/pith/QDQMJK4NMZPVZ4D7JMNLJKKDZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QDQMJK4NMZPVZ4D7JMNLJKKDZY/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-03T20:00:02Z","links":{"resolver":"https://pith.science/pith/QDQMJK4NMZPVZ4D7JMNLJKKDZY","bundle":"https://pith.science/pith/QDQMJK4NMZPVZ4D7JMNLJKKDZY/bundle.json","state":"https://pith.science/pith/QDQMJK4NMZPVZ4D7JMNLJKKDZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QDQMJK4NMZPVZ4D7JMNLJKKDZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QDQMJK4NMZPVZ4D7JMNLJKKDZY","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":"b6b7fb45c1bf502d5b0c19497d28a5c9fb54e5c5125dfaa1fe8c04a48ef1bc6c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-01-12T12:51:45Z","title_canon_sha256":"77f140c0d754c08223193b26f7304e64f7611be0ed7db5dfc565af58449376bc"},"schema_version":"1.0","source":{"id":"1201.2551","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2551","created_at":"2026-05-18T04:04:44Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2551v1","created_at":"2026-05-18T04:04:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2551","created_at":"2026-05-18T04:04:44Z"},{"alias_kind":"pith_short_12","alias_value":"QDQMJK4NMZPV","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QDQMJK4NMZPVZ4D7","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QDQMJK4N","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:33d2d6a2722b3d22e81cb3bca7a61c48c6116f5922eb3334081cd934322243e5","target":"graph","created_at":"2026-05-18T04:04:44Z","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":"Motivated by the problem in [6], which studies the relative efficiency of propositional proof systems, 2-edge colorings of complete bipartite graphs are investigated. It is shown that if the edges of $G=K_{n,n}$ are colored with black and white such that the number of black edges differs from the number of white edges by at most 1, then there are at least $n(1-1/\\sqrt{2})$ vertex-disjoint forks with centers in the same partite set of $G$. Here, a fork is a graph formed by two adjacent edges of different colors. The bound is sharp. Moreover, an algorithm running in time $O(n^2 \\log n \\sqrt{n \\a","authors_text":"Georg Osang, Ignaz Rutter, Marcus Krug, Maria Axenovich","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-01-12T12:51:45Z","title":"Fork-forests in bi-colored complete bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2551","kind":"arxiv","version":1},"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:b511a052f4284b7f12703e6e11fc8d6f649e9a62e002bba9429ce1f328a6cf86","target":"record","created_at":"2026-05-18T04:04:44Z","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":"b6b7fb45c1bf502d5b0c19497d28a5c9fb54e5c5125dfaa1fe8c04a48ef1bc6c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-01-12T12:51:45Z","title_canon_sha256":"77f140c0d754c08223193b26f7304e64f7611be0ed7db5dfc565af58449376bc"},"schema_version":"1.0","source":{"id":"1201.2551","kind":"arxiv","version":1}},"canonical_sha256":"80e0c4ab8d665f5cf07f4b1ab4a943ce367ed4d8fe8526d55b3ed5db93dfad4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80e0c4ab8d665f5cf07f4b1ab4a943ce367ed4d8fe8526d55b3ed5db93dfad4a","first_computed_at":"2026-05-18T04:04:44.171647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:44.171647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QQVzgEVXilccQtsiFZg6CBWlj5kiaUWYPxL9sNIiDQMG4a76kZHfvXifi+Awb9AX3DMv5f5q89jtnqPpEqmNAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:44.172109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.2551","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b511a052f4284b7f12703e6e11fc8d6f649e9a62e002bba9429ce1f328a6cf86","sha256:33d2d6a2722b3d22e81cb3bca7a61c48c6116f5922eb3334081cd934322243e5"],"state_sha256":"ad744be7a252f423139fc18503ff3b88300d75a73d1196ce3ffb2387d7c1389b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2go/KCv8Bje2cPYONOZaerCOOGVZnnNqvkGPI2PHuulewEd1q5PwESz4H7yUwGCYS18hq7fvgY9egYjvcX4GDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:00:02.681878Z","bundle_sha256":"c71c41cbf3b30d6d635fa61ea14edff568628ea637f5f998436a288ea1ae8419"}}