{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WW7BNYBP2D722GJ3IVA27GLIGJ","short_pith_number":"pith:WW7BNYBP","canonical_record":{"source":{"id":"1706.05761","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-19T01:36:58Z","cross_cats_sorted":[],"title_canon_sha256":"f48bcec96f93497b1b13b75c1413b2c6aefb25ece60687f05e70b337669fb519","abstract_canon_sha256":"1c1f19611e47a669c8a71ac359b5ce86446bf1fe8a20f6bd4cf2ab6d2d38dd6e"},"schema_version":"1.0"},"canonical_sha256":"b5be16e02fd0ffad193b4541af9968326073c3b3949cc031d6a694ecdd053ea2","source":{"kind":"arxiv","id":"1706.05761","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05761","created_at":"2026-07-05T01:01:17Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05761v3","created_at":"2026-07-05T01:01:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05761","created_at":"2026-07-05T01:01:17Z"},{"alias_kind":"pith_short_12","alias_value":"WW7BNYBP2D72","created_at":"2026-07-05T01:01:17Z"},{"alias_kind":"pith_short_16","alias_value":"WW7BNYBP2D722GJ3","created_at":"2026-07-05T01:01:17Z"},{"alias_kind":"pith_short_8","alias_value":"WW7BNYBP","created_at":"2026-07-05T01:01:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WW7BNYBP2D722GJ3IVA27GLIGJ","target":"record","payload":{"canonical_record":{"source":{"id":"1706.05761","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-19T01:36:58Z","cross_cats_sorted":[],"title_canon_sha256":"f48bcec96f93497b1b13b75c1413b2c6aefb25ece60687f05e70b337669fb519","abstract_canon_sha256":"1c1f19611e47a669c8a71ac359b5ce86446bf1fe8a20f6bd4cf2ab6d2d38dd6e"},"schema_version":"1.0"},"canonical_sha256":"b5be16e02fd0ffad193b4541af9968326073c3b3949cc031d6a694ecdd053ea2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:01:17.904095Z","signature_b64":"ylYuACY48Zxc6GgZw9HmrVBvHhl5vWHchxv15k4gZFukQoKVrEnafm3to1ZMMbKrJam6wlCA184u/q82PEi5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5be16e02fd0ffad193b4541af9968326073c3b3949cc031d6a694ecdd053ea2","last_reissued_at":"2026-07-05T01:01:17.903737Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:01:17.903737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.05761","source_version":3,"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-07-05T01:01:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V6SSBo+cVaeb4lxqgVqxY/FjbAUBe5TcbLSgkpD+Knsnq4xt+t87aFZ5C8ZzlJ/Ui/xI2X4lh00lbA7MEniuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T20:40:51.712546Z"},"content_sha256":"1eccda1f06547d08ad4d79f1733e92eab8fbffbe3c54a248f82d4c9f498d9a7a","schema_version":"1.0","event_id":"sha256:1eccda1f06547d08ad4d79f1733e92eab8fbffbe3c54a248f82d4c9f498d9a7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WW7BNYBP2D722GJ3IVA27GLIGJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Generalized Matching: $f$-Factors and $f$-Edge Covers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dawei Huang, Seth Pettie","submitted_at":"2017-06-19T01:36:58Z","abstract_excerpt":"In this paper we present linear time approximation schemes for several generalized matching problems on nonbipartite graphs. Our results include $O_\\epsilon(m)$-time algorithms for $(1-\\epsilon)$-maximum weight $f$-factor and $(1+\\epsilon)$-approximate minimum weight $f$-edge cover. As a byproduct, we also obtain direct algorithms for the exact cardinality versions of these problems running in $O(m\\sqrt{f(V)})$ time.\n  The technical contributions of this work include an efficient method for maintaining {\\em relaxed complementary slackness} in generalized matching problems and approximation-pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05761","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1706.05761/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:01:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vhfZShkOAq8VOiJnf/u6e0ynaN3VkvHfwdTnmbUm6ot08dhndd1OPXLAbb8wvCQhpL3BwzP07LOflO6A1A0WDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T20:40:51.712909Z"},"content_sha256":"e0d5f2b1d9b3ffee336eeb847c33ec18d23fdb851760e04f680cec55943d2652","schema_version":"1.0","event_id":"sha256:e0d5f2b1d9b3ffee336eeb847c33ec18d23fdb851760e04f680cec55943d2652"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WW7BNYBP2D722GJ3IVA27GLIGJ/bundle.json","state_url":"https://pith.science/pith/WW7BNYBP2D722GJ3IVA27GLIGJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WW7BNYBP2D722GJ3IVA27GLIGJ/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-07-18T20:40:51Z","links":{"resolver":"https://pith.science/pith/WW7BNYBP2D722GJ3IVA27GLIGJ","bundle":"https://pith.science/pith/WW7BNYBP2D722GJ3IVA27GLIGJ/bundle.json","state":"https://pith.science/pith/WW7BNYBP2D722GJ3IVA27GLIGJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WW7BNYBP2D722GJ3IVA27GLIGJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WW7BNYBP2D722GJ3IVA27GLIGJ","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":"1c1f19611e47a669c8a71ac359b5ce86446bf1fe8a20f6bd4cf2ab6d2d38dd6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-19T01:36:58Z","title_canon_sha256":"f48bcec96f93497b1b13b75c1413b2c6aefb25ece60687f05e70b337669fb519"},"schema_version":"1.0","source":{"id":"1706.05761","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05761","created_at":"2026-07-05T01:01:17Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05761v3","created_at":"2026-07-05T01:01:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05761","created_at":"2026-07-05T01:01:17Z"},{"alias_kind":"pith_short_12","alias_value":"WW7BNYBP2D72","created_at":"2026-07-05T01:01:17Z"},{"alias_kind":"pith_short_16","alias_value":"WW7BNYBP2D722GJ3","created_at":"2026-07-05T01:01:17Z"},{"alias_kind":"pith_short_8","alias_value":"WW7BNYBP","created_at":"2026-07-05T01:01:17Z"}],"graph_snapshots":[{"event_id":"sha256:e0d5f2b1d9b3ffee336eeb847c33ec18d23fdb851760e04f680cec55943d2652","target":"graph","created_at":"2026-07-05T01:01:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1706.05761/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we present linear time approximation schemes for several generalized matching problems on nonbipartite graphs. Our results include $O_\\epsilon(m)$-time algorithms for $(1-\\epsilon)$-maximum weight $f$-factor and $(1+\\epsilon)$-approximate minimum weight $f$-edge cover. As a byproduct, we also obtain direct algorithms for the exact cardinality versions of these problems running in $O(m\\sqrt{f(V)})$ time.\n  The technical contributions of this work include an efficient method for maintaining {\\em relaxed complementary slackness} in generalized matching problems and approximation-pre","authors_text":"Dawei Huang, Seth Pettie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-19T01:36:58Z","title":"Approximate Generalized Matching: $f$-Factors and $f$-Edge Covers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05761","kind":"arxiv","version":3},"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:1eccda1f06547d08ad4d79f1733e92eab8fbffbe3c54a248f82d4c9f498d9a7a","target":"record","created_at":"2026-07-05T01:01:17Z","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":"1c1f19611e47a669c8a71ac359b5ce86446bf1fe8a20f6bd4cf2ab6d2d38dd6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-19T01:36:58Z","title_canon_sha256":"f48bcec96f93497b1b13b75c1413b2c6aefb25ece60687f05e70b337669fb519"},"schema_version":"1.0","source":{"id":"1706.05761","kind":"arxiv","version":3}},"canonical_sha256":"b5be16e02fd0ffad193b4541af9968326073c3b3949cc031d6a694ecdd053ea2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5be16e02fd0ffad193b4541af9968326073c3b3949cc031d6a694ecdd053ea2","first_computed_at":"2026-07-05T01:01:17.903737Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:01:17.903737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ylYuACY48Zxc6GgZw9HmrVBvHhl5vWHchxv15k4gZFukQoKVrEnafm3to1ZMMbKrJam6wlCA184u/q82PEi5BA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:01:17.904095Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.05761","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1eccda1f06547d08ad4d79f1733e92eab8fbffbe3c54a248f82d4c9f498d9a7a","sha256:e0d5f2b1d9b3ffee336eeb847c33ec18d23fdb851760e04f680cec55943d2652"],"state_sha256":"28b1647b6ece95f05c1590d27c7d33a32d43efa1458daa9a5a32d8027a908b7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Sw2bE7ZA9Dyh+KB9DgWZvrpHEMnSP7mt8EmnwR7GUOCHsAoMn+Dbab5yHRjGLPlQYbIhKMv7ZopS0THe1y6Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-18T20:40:51.715389Z","bundle_sha256":"a79fbd34a9dbad7b2c8bb9d97592f2582f862a330b56d93ef90edd2ccb5df638"}}