{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:I37GYVVKGDRE2NXXOA45X6HPBG","short_pith_number":"pith:I37GYVVK","canonical_record":{"source":{"id":"1411.1919","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-07T14:11:06Z","cross_cats_sorted":[],"title_canon_sha256":"c5e12b4360c9c488e1f23ee009755c6f6f9eeeaa88db88edfbf9f8f8be6e0cb1","abstract_canon_sha256":"4817cc5f5dbddbf6d1ef001efcacc1ed222d1aecfaef821497208210d6562997"},"schema_version":"1.0"},"canonical_sha256":"46fe6c56aa30e24d36f77039dbf8ef099785e53e6bbe1c3aab85aae8120ddd17","source":{"kind":"arxiv","id":"1411.1919","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1919","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1919v6","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1919","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"pith_short_12","alias_value":"I37GYVVKGDRE","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I37GYVVKGDRE2NXX","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I37GYVVK","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:I37GYVVKGDRE2NXXOA45X6HPBG","target":"record","payload":{"canonical_record":{"source":{"id":"1411.1919","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-07T14:11:06Z","cross_cats_sorted":[],"title_canon_sha256":"c5e12b4360c9c488e1f23ee009755c6f6f9eeeaa88db88edfbf9f8f8be6e0cb1","abstract_canon_sha256":"4817cc5f5dbddbf6d1ef001efcacc1ed222d1aecfaef821497208210d6562997"},"schema_version":"1.0"},"canonical_sha256":"46fe6c56aa30e24d36f77039dbf8ef099785e53e6bbe1c3aab85aae8120ddd17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:32.934610Z","signature_b64":"B64sANdI+Zn8Ni2wavobIEySn8dk3MFMuPkcfFrbDR2Z+Hk15tBkU6d2XDg9hNvknb8zHIm/DlZ2slPOSUHXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46fe6c56aa30e24d36f77039dbf8ef099785e53e6bbe1c3aab85aae8120ddd17","last_reissued_at":"2026-05-18T00:33:32.933988Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:32.933988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.1919","source_version":6,"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-18T00:33:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lQa9/c6Sc9wcxkOHjl9eEpRBQdKf2cbQYsjhwar7F360vkNR9/OJks0XE6GibSWiaglw2TW3CJorbZuRf5oKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T09:01:38.060901Z"},"content_sha256":"cbebd3d4878b08f6af3d571f2e6ae764e153ba63449ff847180baa6a9bab4c87","schema_version":"1.0","event_id":"sha256:cbebd3d4878b08f6af3d571f2e6ae764e153ba63449ff847180baa6a9bab4c87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:I37GYVVKGDRE2NXXOA45X6HPBG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scaling Algorithms for Weighted Matching in General Graphs","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":"2014-11-07T14:11:06Z","abstract_excerpt":"We present a new scaling algorithm for maximum (or minimum) weight perfect matching on general, edge weighted graphs. Our algorithm runs in $O(m\\sqrt{n}\\log(nN))$ time, $O(m\\sqrt{n})$ per scale, which matches the running time of the best cardinality matching algorithms on sparse graphs. Here $m,n,$ and $N$ bound the number of edges, vertices, and magnitude of any edge weight. Our result improves on a 25-year old algorithm of Gabow and Tarjan, which runs in $O(m\\sqrt{n\\log n\\alpha(m,n)} \\log(nN))$ time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1919","kind":"arxiv","version":6},"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-18T00:33:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PtXw3G/x+HOsizWt0t7zboWRZQjMounXeYFIvNsE5gIXs6kdIg966jc90U/6/ppkSqxbZLhUV5slNdVSFfA8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T09:01:38.061249Z"},"content_sha256":"d7f83043431bd860aad6ab3a69d0fe19e036e8d622a0f94cecb66f0975b3c0c6","schema_version":"1.0","event_id":"sha256:d7f83043431bd860aad6ab3a69d0fe19e036e8d622a0f94cecb66f0975b3c0c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I37GYVVKGDRE2NXXOA45X6HPBG/bundle.json","state_url":"https://pith.science/pith/I37GYVVKGDRE2NXXOA45X6HPBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I37GYVVKGDRE2NXXOA45X6HPBG/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-23T09:01:38Z","links":{"resolver":"https://pith.science/pith/I37GYVVKGDRE2NXXOA45X6HPBG","bundle":"https://pith.science/pith/I37GYVVKGDRE2NXXOA45X6HPBG/bundle.json","state":"https://pith.science/pith/I37GYVVKGDRE2NXXOA45X6HPBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I37GYVVKGDRE2NXXOA45X6HPBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:I37GYVVKGDRE2NXXOA45X6HPBG","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":"4817cc5f5dbddbf6d1ef001efcacc1ed222d1aecfaef821497208210d6562997","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-07T14:11:06Z","title_canon_sha256":"c5e12b4360c9c488e1f23ee009755c6f6f9eeeaa88db88edfbf9f8f8be6e0cb1"},"schema_version":"1.0","source":{"id":"1411.1919","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1919","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1919v6","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1919","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"pith_short_12","alias_value":"I37GYVVKGDRE","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I37GYVVKGDRE2NXX","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I37GYVVK","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:d7f83043431bd860aad6ab3a69d0fe19e036e8d622a0f94cecb66f0975b3c0c6","target":"graph","created_at":"2026-05-18T00:33:32Z","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":"We present a new scaling algorithm for maximum (or minimum) weight perfect matching on general, edge weighted graphs. Our algorithm runs in $O(m\\sqrt{n}\\log(nN))$ time, $O(m\\sqrt{n})$ per scale, which matches the running time of the best cardinality matching algorithms on sparse graphs. Here $m,n,$ and $N$ bound the number of edges, vertices, and magnitude of any edge weight. Our result improves on a 25-year old algorithm of Gabow and Tarjan, which runs in $O(m\\sqrt{n\\log n\\alpha(m,n)} \\log(nN))$ time.","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":"2014-11-07T14:11:06Z","title":"Scaling Algorithms for Weighted Matching in General Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1919","kind":"arxiv","version":6},"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:cbebd3d4878b08f6af3d571f2e6ae764e153ba63449ff847180baa6a9bab4c87","target":"record","created_at":"2026-05-18T00:33:32Z","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":"4817cc5f5dbddbf6d1ef001efcacc1ed222d1aecfaef821497208210d6562997","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-07T14:11:06Z","title_canon_sha256":"c5e12b4360c9c488e1f23ee009755c6f6f9eeeaa88db88edfbf9f8f8be6e0cb1"},"schema_version":"1.0","source":{"id":"1411.1919","kind":"arxiv","version":6}},"canonical_sha256":"46fe6c56aa30e24d36f77039dbf8ef099785e53e6bbe1c3aab85aae8120ddd17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46fe6c56aa30e24d36f77039dbf8ef099785e53e6bbe1c3aab85aae8120ddd17","first_computed_at":"2026-05-18T00:33:32.933988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:32.933988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B64sANdI+Zn8Ni2wavobIEySn8dk3MFMuPkcfFrbDR2Z+Hk15tBkU6d2XDg9hNvknb8zHIm/DlZ2slPOSUHXAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:32.934610Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.1919","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbebd3d4878b08f6af3d571f2e6ae764e153ba63449ff847180baa6a9bab4c87","sha256:d7f83043431bd860aad6ab3a69d0fe19e036e8d622a0f94cecb66f0975b3c0c6"],"state_sha256":"4bbd4eccd1aefbaa449a26b69488d8aebf69ba49febae2313f0858cc53bbbfe1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"59yEH57/IDmTIN6gVvhyVZmCLNzWH+SnnozbkOMUOOtTkX7T/1rNUAuOaSGx62KGh/tkFAZZsjj+BMQnObTPDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T09:01:38.063198Z","bundle_sha256":"c2bf6949873405b06888d90497e5e191d6449d854ba33d359a63ed803f6ff24d"}}