{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MKRKRDRZCCWWGIHPVX643L2ZFB","short_pith_number":"pith:MKRKRDRZ","canonical_record":{"source":{"id":"1112.0790","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-04T20:05:24Z","cross_cats_sorted":[],"title_canon_sha256":"da81c4c32386ed67b946f878769ec2dbdff69f483eb348fdcef2637cf0fa5031","abstract_canon_sha256":"0eca9563f8a1b7fbd165e37fa8f9b226edaace21eaf90b7df84c26ccb02c5c99"},"schema_version":"1.0"},"canonical_sha256":"62a2a88e3910ad6320efadfdcdaf592851ed772795060ada0ccef67835046b8d","source":{"kind":"arxiv","id":"1112.0790","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0790","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0790v1","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0790","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"pith_short_12","alias_value":"MKRKRDRZCCWW","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MKRKRDRZCCWWGIHP","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MKRKRDRZ","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MKRKRDRZCCWWGIHPVX643L2ZFB","target":"record","payload":{"canonical_record":{"source":{"id":"1112.0790","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-04T20:05:24Z","cross_cats_sorted":[],"title_canon_sha256":"da81c4c32386ed67b946f878769ec2dbdff69f483eb348fdcef2637cf0fa5031","abstract_canon_sha256":"0eca9563f8a1b7fbd165e37fa8f9b226edaace21eaf90b7df84c26ccb02c5c99"},"schema_version":"1.0"},"canonical_sha256":"62a2a88e3910ad6320efadfdcdaf592851ed772795060ada0ccef67835046b8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:05.613176Z","signature_b64":"Fsq910D7wNlGRCBP3WmpeS191YQq4SLxXupJmBf0aU4Pnx6uEzSe57/2p78uY6LwaCdSn+AAyrkOycyixoxfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62a2a88e3910ad6320efadfdcdaf592851ed772795060ada0ccef67835046b8d","last_reissued_at":"2026-05-18T04:07:05.612462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:05.612462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.0790","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:07:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1SlTBzZUPygBj+7jMmSmqUm3xRvpqbz8IdWzrKyIl4k/PXpXKr4VzkiEmIVudTn97fYFNUxdHPmRSHt/JnQABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:56:59.190379Z"},"content_sha256":"505f53381b353d31f1716197e1a2487eb365e2b2bcdc34da5cf9884c57f59ccd","schema_version":"1.0","event_id":"sha256:505f53381b353d31f1716197e1a2487eb365e2b2bcdc34da5cf9884c57f59ccd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MKRKRDRZCCWWGIHPVX643L2ZFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scaling algorithms for approximate and exact maximum weight matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hsin-Hao Su, Ran Duan, Seth Pettie","submitted_at":"2011-12-04T20:05:24Z","abstract_excerpt":"The {\\em maximum cardinality} and {\\em maximum weight matching} problems can be solved in time $\\tilde{O}(m\\sqrt{n})$, a bound that has resisted improvement despite decades of research. (Here $m$ and $n$ are the number of edges and vertices.) In this article we demonstrate that this \"$m\\sqrt{n}$ barrier\" is extremely fragile, in the following sense. For any $\\epsilon>0$, we give an algorithm that computes a $(1-\\epsilon)$-approximate maximum weight matching in $O(m\\epsilon^{-1}\\log\\epsilon^{-1})$ time, that is, optimal {\\em linear time} for any fixed $\\epsilon$. Our algorithm is dramatically s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0790","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:07:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8DS8xlbICj2wOP2HrGZh1QNI9UaaF0NLM4IdnznSXHU4YApKvg7BZSjX1NytvpjFYJxvPUp4uk/j1VwpjcWnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:56:59.190728Z"},"content_sha256":"9beee635180e34a97610fcf70c47d555bec8f7eaec0ee4a9e5983e005578df97","schema_version":"1.0","event_id":"sha256:9beee635180e34a97610fcf70c47d555bec8f7eaec0ee4a9e5983e005578df97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MKRKRDRZCCWWGIHPVX643L2ZFB/bundle.json","state_url":"https://pith.science/pith/MKRKRDRZCCWWGIHPVX643L2ZFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MKRKRDRZCCWWGIHPVX643L2ZFB/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-22T21:56:59Z","links":{"resolver":"https://pith.science/pith/MKRKRDRZCCWWGIHPVX643L2ZFB","bundle":"https://pith.science/pith/MKRKRDRZCCWWGIHPVX643L2ZFB/bundle.json","state":"https://pith.science/pith/MKRKRDRZCCWWGIHPVX643L2ZFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MKRKRDRZCCWWGIHPVX643L2ZFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MKRKRDRZCCWWGIHPVX643L2ZFB","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":"0eca9563f8a1b7fbd165e37fa8f9b226edaace21eaf90b7df84c26ccb02c5c99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-04T20:05:24Z","title_canon_sha256":"da81c4c32386ed67b946f878769ec2dbdff69f483eb348fdcef2637cf0fa5031"},"schema_version":"1.0","source":{"id":"1112.0790","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0790","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0790v1","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0790","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"pith_short_12","alias_value":"MKRKRDRZCCWW","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MKRKRDRZCCWWGIHP","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MKRKRDRZ","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:9beee635180e34a97610fcf70c47d555bec8f7eaec0ee4a9e5983e005578df97","target":"graph","created_at":"2026-05-18T04:07:05Z","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":"The {\\em maximum cardinality} and {\\em maximum weight matching} problems can be solved in time $\\tilde{O}(m\\sqrt{n})$, a bound that has resisted improvement despite decades of research. (Here $m$ and $n$ are the number of edges and vertices.) In this article we demonstrate that this \"$m\\sqrt{n}$ barrier\" is extremely fragile, in the following sense. For any $\\epsilon>0$, we give an algorithm that computes a $(1-\\epsilon)$-approximate maximum weight matching in $O(m\\epsilon^{-1}\\log\\epsilon^{-1})$ time, that is, optimal {\\em linear time} for any fixed $\\epsilon$. Our algorithm is dramatically s","authors_text":"Hsin-Hao Su, Ran Duan, Seth Pettie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-04T20:05:24Z","title":"Scaling algorithms for approximate and exact maximum weight matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0790","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:505f53381b353d31f1716197e1a2487eb365e2b2bcdc34da5cf9884c57f59ccd","target":"record","created_at":"2026-05-18T04:07:05Z","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":"0eca9563f8a1b7fbd165e37fa8f9b226edaace21eaf90b7df84c26ccb02c5c99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-04T20:05:24Z","title_canon_sha256":"da81c4c32386ed67b946f878769ec2dbdff69f483eb348fdcef2637cf0fa5031"},"schema_version":"1.0","source":{"id":"1112.0790","kind":"arxiv","version":1}},"canonical_sha256":"62a2a88e3910ad6320efadfdcdaf592851ed772795060ada0ccef67835046b8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62a2a88e3910ad6320efadfdcdaf592851ed772795060ada0ccef67835046b8d","first_computed_at":"2026-05-18T04:07:05.612462Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:05.612462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fsq910D7wNlGRCBP3WmpeS191YQq4SLxXupJmBf0aU4Pnx6uEzSe57/2p78uY6LwaCdSn+AAyrkOycyixoxfCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:05.613176Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.0790","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:505f53381b353d31f1716197e1a2487eb365e2b2bcdc34da5cf9884c57f59ccd","sha256:9beee635180e34a97610fcf70c47d555bec8f7eaec0ee4a9e5983e005578df97"],"state_sha256":"94a8509d3e623dff962a11ad58a6d9fe2540164fc70f1addf44d5f3ff4943897"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HE5TDrC+tec4LzeQCAbBJAdfV01eqgQga+bgO0pCKuN81GVA3FoOQ91n8ff2YvZrs4kU5N8gg+4549v0gu1gDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T21:56:59.193576Z","bundle_sha256":"230e5fb24c50e4d452c7eb420861e9070126cb5b8edc5766a0a9e708192d78a0"}}