{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5OFOWFOH3YBM6JK5NP4P2JPODR","short_pith_number":"pith:5OFOWFOH","schema_version":"1.0","canonical_sha256":"eb8aeb15c7de02cf255d6bf8fd25ee1c6039def9d74b72ead037649133a9c7a0","source":{"kind":"arxiv","id":"1705.10396","version":1},"attestation_state":"computed","paper":{"title":"Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sara Ahmadian, Zachary Friggstad","submitted_at":"2017-05-29T20:55:29Z","abstract_excerpt":"We pursue a study of the Generalized Demand Matching problem, a common generalization of the $b$-Matching and Knapsack problems. Here, we are given a graph with vertex capacities, edge profits, and asymmetric demands on the edges. The goal is to find a maximum-profit subset of edges so the demands of chosen edges do not violate vertex capacities. This problem is APX-hard and constant-factor approximations are known.\n  Our results fall into two categories. First, using iterated relaxation and various filtering strategies, we show with an efficient rounding algorithm if an additional matroid str"},"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":"1705.10396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-29T20:55:29Z","cross_cats_sorted":[],"title_canon_sha256":"427b5fa909ae3b20f8df19b311cc542dd72991529d7e02de8bea2767985d7606","abstract_canon_sha256":"434143780c9753eae207fea19574cec7b9b251ec1c5728b7b8a137aada8d357a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:31.163176Z","signature_b64":"0DeTiSKNDXRXUQ7HayY8INBo2wReYrXawD7N3326CQct8s9CfWfKWg4WvnK7MjDo4OU0W6F5z6wSgl7tKDWBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb8aeb15c7de02cf255d6bf8fd25ee1c6039def9d74b72ead037649133a9c7a0","last_reissued_at":"2026-05-18T00:43:31.162623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:31.162623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sara Ahmadian, Zachary Friggstad","submitted_at":"2017-05-29T20:55:29Z","abstract_excerpt":"We pursue a study of the Generalized Demand Matching problem, a common generalization of the $b$-Matching and Knapsack problems. Here, we are given a graph with vertex capacities, edge profits, and asymmetric demands on the edges. The goal is to find a maximum-profit subset of edges so the demands of chosen edges do not violate vertex capacities. This problem is APX-hard and constant-factor approximations are known.\n  Our results fall into two categories. First, using iterated relaxation and various filtering strategies, we show with an efficient rounding algorithm if an additional matroid str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10396","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.10396","created_at":"2026-05-18T00:43:31.162702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10396v1","created_at":"2026-05-18T00:43:31.162702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10396","created_at":"2026-05-18T00:43:31.162702+00:00"},{"alias_kind":"pith_short_12","alias_value":"5OFOWFOH3YBM","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5OFOWFOH3YBM6JK5","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5OFOWFOH","created_at":"2026-05-18T12:31:00.734936+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/5OFOWFOH3YBM6JK5NP4P2JPODR","json":"https://pith.science/pith/5OFOWFOH3YBM6JK5NP4P2JPODR.json","graph_json":"https://pith.science/api/pith-number/5OFOWFOH3YBM6JK5NP4P2JPODR/graph.json","events_json":"https://pith.science/api/pith-number/5OFOWFOH3YBM6JK5NP4P2JPODR/events.json","paper":"https://pith.science/paper/5OFOWFOH"},"agent_actions":{"view_html":"https://pith.science/pith/5OFOWFOH3YBM6JK5NP4P2JPODR","download_json":"https://pith.science/pith/5OFOWFOH3YBM6JK5NP4P2JPODR.json","view_paper":"https://pith.science/paper/5OFOWFOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10396&json=true","fetch_graph":"https://pith.science/api/pith-number/5OFOWFOH3YBM6JK5NP4P2JPODR/graph.json","fetch_events":"https://pith.science/api/pith-number/5OFOWFOH3YBM6JK5NP4P2JPODR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5OFOWFOH3YBM6JK5NP4P2JPODR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5OFOWFOH3YBM6JK5NP4P2JPODR/action/storage_attestation","attest_author":"https://pith.science/pith/5OFOWFOH3YBM6JK5NP4P2JPODR/action/author_attestation","sign_citation":"https://pith.science/pith/5OFOWFOH3YBM6JK5NP4P2JPODR/action/citation_signature","submit_replication":"https://pith.science/pith/5OFOWFOH3YBM6JK5NP4P2JPODR/action/replication_record"}},"created_at":"2026-05-18T00:43:31.162702+00:00","updated_at":"2026-05-18T00:43:31.162702+00:00"}