{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WW7BNYBP2D722GJ3IVA27GLIGJ","short_pith_number":"pith:WW7BNYBP","schema_version":"1.0","canonical_sha256":"b5be16e02fd0ffad193b4541af9968326073c3b3949cc031d6a694ecdd053ea2","source":{"kind":"arxiv","id":"1706.05761","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.05761","created_at":"2026-07-05T01:01:17.903793+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.05761v3","created_at":"2026-07-05T01:01:17.903793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05761","created_at":"2026-07-05T01:01:17.903793+00:00"},{"alias_kind":"pith_short_12","alias_value":"WW7BNYBP2D72","created_at":"2026-07-05T01:01:17.903793+00:00"},{"alias_kind":"pith_short_16","alias_value":"WW7BNYBP2D722GJ3","created_at":"2026-07-05T01:01:17.903793+00:00"},{"alias_kind":"pith_short_8","alias_value":"WW7BNYBP","created_at":"2026-07-05T01:01:17.903793+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WW7BNYBP2D722GJ3IVA27GLIGJ","json":"https://pith.science/pith/WW7BNYBP2D722GJ3IVA27GLIGJ.json","graph_json":"https://pith.science/api/pith-number/WW7BNYBP2D722GJ3IVA27GLIGJ/graph.json","events_json":"https://pith.science/api/pith-number/WW7BNYBP2D722GJ3IVA27GLIGJ/events.json","paper":"https://pith.science/paper/WW7BNYBP"},"agent_actions":{"view_html":"https://pith.science/pith/WW7BNYBP2D722GJ3IVA27GLIGJ","download_json":"https://pith.science/pith/WW7BNYBP2D722GJ3IVA27GLIGJ.json","view_paper":"https://pith.science/paper/WW7BNYBP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.05761&json=true","fetch_graph":"https://pith.science/api/pith-number/WW7BNYBP2D722GJ3IVA27GLIGJ/graph.json","fetch_events":"https://pith.science/api/pith-number/WW7BNYBP2D722GJ3IVA27GLIGJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WW7BNYBP2D722GJ3IVA27GLIGJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WW7BNYBP2D722GJ3IVA27GLIGJ/action/storage_attestation","attest_author":"https://pith.science/pith/WW7BNYBP2D722GJ3IVA27GLIGJ/action/author_attestation","sign_citation":"https://pith.science/pith/WW7BNYBP2D722GJ3IVA27GLIGJ/action/citation_signature","submit_replication":"https://pith.science/pith/WW7BNYBP2D722GJ3IVA27GLIGJ/action/replication_record"}},"created_at":"2026-07-05T01:01:17.903793+00:00","updated_at":"2026-07-05T01:01:17.903793+00:00"}