{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2YLCOTPZAAOQF6XPBRDADIB6IF","short_pith_number":"pith:2YLCOTPZ","canonical_record":{"source":{"id":"1304.6740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-24T20:26:13Z","cross_cats_sorted":[],"title_canon_sha256":"d6ac0f36cc327945865b1dfcafcb45b517d2ae6d56fa0a1e255e7e0ce53f8edd","abstract_canon_sha256":"bba020905a7d0a85dab850b8bbfb8ece566ec266f5b34862d3f9c574903a56d7"},"schema_version":"1.0"},"canonical_sha256":"d616274df9001d02faef0c4601a03e415c0dc8230e92e0efaee7b714abfe4a80","source":{"kind":"arxiv","id":"1304.6740","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6740","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6740v1","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6740","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"pith_short_12","alias_value":"2YLCOTPZAAOQ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2YLCOTPZAAOQF6XP","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2YLCOTPZ","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2YLCOTPZAAOQF6XPBRDADIB6IF","target":"record","payload":{"canonical_record":{"source":{"id":"1304.6740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-24T20:26:13Z","cross_cats_sorted":[],"title_canon_sha256":"d6ac0f36cc327945865b1dfcafcb45b517d2ae6d56fa0a1e255e7e0ce53f8edd","abstract_canon_sha256":"bba020905a7d0a85dab850b8bbfb8ece566ec266f5b34862d3f9c574903a56d7"},"schema_version":"1.0"},"canonical_sha256":"d616274df9001d02faef0c4601a03e415c0dc8230e92e0efaee7b714abfe4a80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:11.976437Z","signature_b64":"fzzzIS6osaAyu0D3f6om2gettUkJRETwCZTvwsIpII9zJenUo06RveYH9hwqiuNtZj8LubF7C3zKzhYF2sc3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d616274df9001d02faef0c4601a03e415c0dc8230e92e0efaee7b714abfe4a80","last_reissued_at":"2026-05-18T03:27:11.975736Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:11.975736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.6740","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:27:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MYblwcCba35QaYEpQZeIO2dqMLZhe8PEy9EbT7hITxlC2W81qHCT2AG/NrmL18f4vjRCuRf7Wnm2B5xqt0goCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:48:58.495529Z"},"content_sha256":"0b3d9fbcedd3296b06bc74db179562a3ccbd1a6da28691bc63896e247dd9763f","schema_version":"1.0","event_id":"sha256:0b3d9fbcedd3296b06bc74db179562a3ccbd1a6da28691bc63896e247dd9763f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2YLCOTPZAAOQF6XPBRDADIB6IF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algebraic Algorithms for b-Matching, Shortest Undirected Paths, and f-Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Harold N. Gabow, Piotr Sankowski","submitted_at":"2013-04-24T20:26:13Z","abstract_excerpt":"Let G=(V,E) be a graph with f:V\\to Z_+ a function assigning degree bounds to vertices. We present the first efficient algebraic algorithm to find an f-factor. The time is \\tilde{O}(f(V)^{\\omega}). More generally for graphs with integral edge weights of maximum absolute value W we find a maximum weight f-factor in time \\tilde{O}(Wf(V)^{\\omega}). (The algorithms are randomized, correct with high probability and Las Vegas; the time bound is worst-case.) We also present three specializations of these algorithms: For maximum weight perfect f-matching the algorithm is considerably simpler (and almos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6740","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:27:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DOf5cFI3OzPODBJxExiCU/Ra/chbQDTBHIr32MZUUxVpfUZ7vRgN8ebXRAY0SOnWOwCc071weEuerv0njoUPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:48:58.496213Z"},"content_sha256":"06d7ec4128135042b24e39e3cf69888cec6905d28a25f0b01be406637ea5ca38","schema_version":"1.0","event_id":"sha256:06d7ec4128135042b24e39e3cf69888cec6905d28a25f0b01be406637ea5ca38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2YLCOTPZAAOQF6XPBRDADIB6IF/bundle.json","state_url":"https://pith.science/pith/2YLCOTPZAAOQF6XPBRDADIB6IF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2YLCOTPZAAOQF6XPBRDADIB6IF/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-31T20:48:58Z","links":{"resolver":"https://pith.science/pith/2YLCOTPZAAOQF6XPBRDADIB6IF","bundle":"https://pith.science/pith/2YLCOTPZAAOQF6XPBRDADIB6IF/bundle.json","state":"https://pith.science/pith/2YLCOTPZAAOQF6XPBRDADIB6IF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2YLCOTPZAAOQF6XPBRDADIB6IF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2YLCOTPZAAOQF6XPBRDADIB6IF","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":"bba020905a7d0a85dab850b8bbfb8ece566ec266f5b34862d3f9c574903a56d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-24T20:26:13Z","title_canon_sha256":"d6ac0f36cc327945865b1dfcafcb45b517d2ae6d56fa0a1e255e7e0ce53f8edd"},"schema_version":"1.0","source":{"id":"1304.6740","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6740","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6740v1","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6740","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"pith_short_12","alias_value":"2YLCOTPZAAOQ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2YLCOTPZAAOQF6XP","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2YLCOTPZ","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:06d7ec4128135042b24e39e3cf69888cec6905d28a25f0b01be406637ea5ca38","target":"graph","created_at":"2026-05-18T03:27:11Z","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 G=(V,E) be a graph with f:V\\to Z_+ a function assigning degree bounds to vertices. We present the first efficient algebraic algorithm to find an f-factor. The time is \\tilde{O}(f(V)^{\\omega}). More generally for graphs with integral edge weights of maximum absolute value W we find a maximum weight f-factor in time \\tilde{O}(Wf(V)^{\\omega}). (The algorithms are randomized, correct with high probability and Las Vegas; the time bound is worst-case.) We also present three specializations of these algorithms: For maximum weight perfect f-matching the algorithm is considerably simpler (and almos","authors_text":"Harold N. Gabow, Piotr Sankowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-24T20:26:13Z","title":"Algebraic Algorithms for b-Matching, Shortest Undirected Paths, and f-Factors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6740","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:0b3d9fbcedd3296b06bc74db179562a3ccbd1a6da28691bc63896e247dd9763f","target":"record","created_at":"2026-05-18T03:27:11Z","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":"bba020905a7d0a85dab850b8bbfb8ece566ec266f5b34862d3f9c574903a56d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-24T20:26:13Z","title_canon_sha256":"d6ac0f36cc327945865b1dfcafcb45b517d2ae6d56fa0a1e255e7e0ce53f8edd"},"schema_version":"1.0","source":{"id":"1304.6740","kind":"arxiv","version":1}},"canonical_sha256":"d616274df9001d02faef0c4601a03e415c0dc8230e92e0efaee7b714abfe4a80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d616274df9001d02faef0c4601a03e415c0dc8230e92e0efaee7b714abfe4a80","first_computed_at":"2026-05-18T03:27:11.975736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:11.975736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fzzzIS6osaAyu0D3f6om2gettUkJRETwCZTvwsIpII9zJenUo06RveYH9hwqiuNtZj8LubF7C3zKzhYF2sc3AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:11.976437Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6740","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b3d9fbcedd3296b06bc74db179562a3ccbd1a6da28691bc63896e247dd9763f","sha256:06d7ec4128135042b24e39e3cf69888cec6905d28a25f0b01be406637ea5ca38"],"state_sha256":"e5a2711cd01a99e472d697f987e445fd12126cf34dbc634f85d481d02554b21d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1knTmyq+mCxDC0TPwVbQlUVSowZ+/NoqQfY40hqwFu3m0G2VDprT5VuV5TB6NdA1X11gHMuoRWVTAnZkeGV/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:48:58.499999Z","bundle_sha256":"df622359619b7474b9b282936f28408928127aca4908b3335438be209db11c3d"}}