{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RXO3IPSOPYVQ53TSQYOCNBLPFD","short_pith_number":"pith:RXO3IPSO","canonical_record":{"source":{"id":"1205.4605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-05-21T14:07:00Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"1abe5a4a0ac370fcbe8704058b0130e91eea2146b527799539a8b03b99874aaa","abstract_canon_sha256":"d3bbc7746f24a1aa0251eea2fcbaa06ab5e14f04a10a50a1991994214a23b9e6"},"schema_version":"1.0"},"canonical_sha256":"8dddb43e4e7e2b0eee72861c26856f28ea635ec04ba2a7d077d8285a34ac0b2f","source":{"kind":"arxiv","id":"1205.4605","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4605","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4605v1","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4605","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"RXO3IPSOPYVQ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RXO3IPSOPYVQ53TS","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RXO3IPSO","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RXO3IPSOPYVQ53TSQYOCNBLPFD","target":"record","payload":{"canonical_record":{"source":{"id":"1205.4605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-05-21T14:07:00Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"1abe5a4a0ac370fcbe8704058b0130e91eea2146b527799539a8b03b99874aaa","abstract_canon_sha256":"d3bbc7746f24a1aa0251eea2fcbaa06ab5e14f04a10a50a1991994214a23b9e6"},"schema_version":"1.0"},"canonical_sha256":"8dddb43e4e7e2b0eee72861c26856f28ea635ec04ba2a7d077d8285a34ac0b2f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:06.865207Z","signature_b64":"44O2WsKQF9H2TmmeaX/1DhByqeUhjneJssj9v1YTV6gcdbA1SVYNxEMLq5tp/7Xi0jYRSglfhMtdkdauhe5CBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dddb43e4e7e2b0eee72861c26856f28ea635ec04ba2a7d077d8285a34ac0b2f","last_reissued_at":"2026-05-18T03:04:06.864764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:06.864764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.4605","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-18T03:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PLdb51KHpz5KSTYUvperAKN/GvHmDHzlY936U/6/Vub5oN2FW9TD4m9eld1TF0u8zBHLPQxDkkXhzi/JfrWvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:10:14.240771Z"},"content_sha256":"351e6b24b1f18bfb8de47fcdc328f8d4514c092e5769a2ee89e6cf0f982a83d4","schema_version":"1.0","event_id":"sha256:351e6b24b1f18bfb8de47fcdc328f8d4514c092e5769a2ee89e6cf0f982a83d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RXO3IPSOPYVQ53TSQYOCNBLPFD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"No Sublogarithmic-time Approximation Scheme for Bipartite Vertex Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DC","authors_text":"Jukka Suomela, Mika G\\\"o\\\"os","submitted_at":"2012-05-21T14:07:00Z","abstract_excerpt":"K\\\"onig's theorem states that on bipartite graphs the size of a maximum matching equals the size of a minimum vertex cover. It is known from prior work that for every \\epsilon > 0 there exists a constant-time distributed algorithm that finds a (1+\\epsilon)-approximation of a maximum matching on 2-coloured graphs of bounded degree. In this work, we show---somewhat surprisingly---that no sublogarithmic-time approximation scheme exists for the dual problem: there is a constant \\delta > 0 so that no randomised distributed algorithm with running time o(\\log n) can find a (1+\\delta)-approximation of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4605","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-18T03:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ccVfUqcZTQfA0b45CKuyzzF76H3ewUXNTBYBEjJA3XrZ8xnZFTNaMy5g/b5XCabLgkP211R2257MwsB+96yoBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:10:14.241336Z"},"content_sha256":"83c6da7292c46bb9f9deeb18cc504a44f1b41925199dd6671dc2e20d52f6157b","schema_version":"1.0","event_id":"sha256:83c6da7292c46bb9f9deeb18cc504a44f1b41925199dd6671dc2e20d52f6157b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RXO3IPSOPYVQ53TSQYOCNBLPFD/bundle.json","state_url":"https://pith.science/pith/RXO3IPSOPYVQ53TSQYOCNBLPFD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RXO3IPSOPYVQ53TSQYOCNBLPFD/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-27T22:10:14Z","links":{"resolver":"https://pith.science/pith/RXO3IPSOPYVQ53TSQYOCNBLPFD","bundle":"https://pith.science/pith/RXO3IPSOPYVQ53TSQYOCNBLPFD/bundle.json","state":"https://pith.science/pith/RXO3IPSOPYVQ53TSQYOCNBLPFD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RXO3IPSOPYVQ53TSQYOCNBLPFD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RXO3IPSOPYVQ53TSQYOCNBLPFD","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":"d3bbc7746f24a1aa0251eea2fcbaa06ab5e14f04a10a50a1991994214a23b9e6","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-05-21T14:07:00Z","title_canon_sha256":"1abe5a4a0ac370fcbe8704058b0130e91eea2146b527799539a8b03b99874aaa"},"schema_version":"1.0","source":{"id":"1205.4605","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4605","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4605v1","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4605","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"RXO3IPSOPYVQ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RXO3IPSOPYVQ53TS","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RXO3IPSO","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:83c6da7292c46bb9f9deeb18cc504a44f1b41925199dd6671dc2e20d52f6157b","target":"graph","created_at":"2026-05-18T03:04:06Z","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":"K\\\"onig's theorem states that on bipartite graphs the size of a maximum matching equals the size of a minimum vertex cover. It is known from prior work that for every \\epsilon > 0 there exists a constant-time distributed algorithm that finds a (1+\\epsilon)-approximation of a maximum matching on 2-coloured graphs of bounded degree. In this work, we show---somewhat surprisingly---that no sublogarithmic-time approximation scheme exists for the dual problem: there is a constant \\delta > 0 so that no randomised distributed algorithm with running time o(\\log n) can find a (1+\\delta)-approximation of","authors_text":"Jukka Suomela, Mika G\\\"o\\\"os","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-05-21T14:07:00Z","title":"No Sublogarithmic-time Approximation Scheme for Bipartite Vertex Cover"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4605","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:351e6b24b1f18bfb8de47fcdc328f8d4514c092e5769a2ee89e6cf0f982a83d4","target":"record","created_at":"2026-05-18T03:04:06Z","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":"d3bbc7746f24a1aa0251eea2fcbaa06ab5e14f04a10a50a1991994214a23b9e6","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-05-21T14:07:00Z","title_canon_sha256":"1abe5a4a0ac370fcbe8704058b0130e91eea2146b527799539a8b03b99874aaa"},"schema_version":"1.0","source":{"id":"1205.4605","kind":"arxiv","version":1}},"canonical_sha256":"8dddb43e4e7e2b0eee72861c26856f28ea635ec04ba2a7d077d8285a34ac0b2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8dddb43e4e7e2b0eee72861c26856f28ea635ec04ba2a7d077d8285a34ac0b2f","first_computed_at":"2026-05-18T03:04:06.864764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:06.864764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"44O2WsKQF9H2TmmeaX/1DhByqeUhjneJssj9v1YTV6gcdbA1SVYNxEMLq5tp/7Xi0jYRSglfhMtdkdauhe5CBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:06.865207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.4605","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:351e6b24b1f18bfb8de47fcdc328f8d4514c092e5769a2ee89e6cf0f982a83d4","sha256:83c6da7292c46bb9f9deeb18cc504a44f1b41925199dd6671dc2e20d52f6157b"],"state_sha256":"6dd5c34280204b38aa16301642c7b7223e346f0effb79c9abc875df118bb6837"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4QeslE5XZ01O3Lc1JoaUCBnNpUF3okB4Y9x8GUimNx78JiFgN5m6PmJSmPsN06zYdD9FwVYIY8SJgWALVBM1BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:10:14.243592Z","bundle_sha256":"aac29203c364607dd2bd5b65bdae179ea7f728462ed2ad95ae950fa8e4629b92"}}