{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OKHM3F2ZTYBWWZV7RIX4EXEL5N","short_pith_number":"pith:OKHM3F2Z","schema_version":"1.0","canonical_sha256":"728ecd97599e036b66bf8a2fc25c8beb620791d38adc7786d03164887af9fb33","source":{"kind":"arxiv","id":"1212.3889","version":1},"attestation_state":"computed","paper":{"title":"Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pawan Aurora, Shashank K. Mehta, Sumit Singh","submitted_at":"2012-12-17T05:28:46Z","abstract_excerpt":"We study the Partial Degree Bounded Edge Packing (PDBEP) problem introduced in [5] by Zhang. They have shown that this problem is NP-Hard even for uniform degree constraint. They also presented approximation algorithms for the case when all the vertices have degree constraint of 1 and 2 with approximation ratio of 2 and 32=11 respectively. In this work we study general degree constraint case (arbitrary degree constraint for each vertex) and present two combinatorial approximation algorithms with approximation factors 4 and 2. We also study integer program based solution and present an iterativ"},"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":"1212.3889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-17T05:28:46Z","cross_cats_sorted":[],"title_canon_sha256":"a1bec476d8a37e8bbe29e5ffb7708e75ad5fc4893f1aa8c36bd55b9817083136","abstract_canon_sha256":"20407988755a5d1757a6fa5850b6137e75591010b6db4a77be9296bae6d58888"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:22.146794Z","signature_b64":"3UIRWQSK1OkRfRB/fw4laf3BzQ5rXE78k4IZyFtP/0yQG+5z/5Q42mNeiF3IRdtpXgchESfcerAAPmP+X7frBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"728ecd97599e036b66bf8a2fc25c8beb620791d38adc7786d03164887af9fb33","last_reissued_at":"2026-05-18T03:38:22.146067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:22.146067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pawan Aurora, Shashank K. Mehta, Sumit Singh","submitted_at":"2012-12-17T05:28:46Z","abstract_excerpt":"We study the Partial Degree Bounded Edge Packing (PDBEP) problem introduced in [5] by Zhang. They have shown that this problem is NP-Hard even for uniform degree constraint. They also presented approximation algorithms for the case when all the vertices have degree constraint of 1 and 2 with approximation ratio of 2 and 32=11 respectively. In this work we study general degree constraint case (arbitrary degree constraint for each vertex) and present two combinatorial approximation algorithms with approximation factors 4 and 2. We also study integer program based solution and present an iterativ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3889","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":"1212.3889","created_at":"2026-05-18T03:38:22.146228+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.3889v1","created_at":"2026-05-18T03:38:22.146228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3889","created_at":"2026-05-18T03:38:22.146228+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKHM3F2ZTYBW","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKHM3F2ZTYBWWZV7","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKHM3F2Z","created_at":"2026-05-18T12:27:16.716162+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/OKHM3F2ZTYBWWZV7RIX4EXEL5N","json":"https://pith.science/pith/OKHM3F2ZTYBWWZV7RIX4EXEL5N.json","graph_json":"https://pith.science/api/pith-number/OKHM3F2ZTYBWWZV7RIX4EXEL5N/graph.json","events_json":"https://pith.science/api/pith-number/OKHM3F2ZTYBWWZV7RIX4EXEL5N/events.json","paper":"https://pith.science/paper/OKHM3F2Z"},"agent_actions":{"view_html":"https://pith.science/pith/OKHM3F2ZTYBWWZV7RIX4EXEL5N","download_json":"https://pith.science/pith/OKHM3F2ZTYBWWZV7RIX4EXEL5N.json","view_paper":"https://pith.science/paper/OKHM3F2Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.3889&json=true","fetch_graph":"https://pith.science/api/pith-number/OKHM3F2ZTYBWWZV7RIX4EXEL5N/graph.json","fetch_events":"https://pith.science/api/pith-number/OKHM3F2ZTYBWWZV7RIX4EXEL5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKHM3F2ZTYBWWZV7RIX4EXEL5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKHM3F2ZTYBWWZV7RIX4EXEL5N/action/storage_attestation","attest_author":"https://pith.science/pith/OKHM3F2ZTYBWWZV7RIX4EXEL5N/action/author_attestation","sign_citation":"https://pith.science/pith/OKHM3F2ZTYBWWZV7RIX4EXEL5N/action/citation_signature","submit_replication":"https://pith.science/pith/OKHM3F2ZTYBWWZV7RIX4EXEL5N/action/replication_record"}},"created_at":"2026-05-18T03:38:22.146228+00:00","updated_at":"2026-05-18T03:38:22.146228+00:00"}