{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OKHM3F2ZTYBWWZV7RIX4EXEL5N","short_pith_number":"pith:OKHM3F2Z","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"},"canonical_sha256":"728ecd97599e036b66bf8a2fc25c8beb620791d38adc7786d03164887af9fb33","source":{"kind":"arxiv","id":"1212.3889","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3889","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3889v1","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3889","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"pith_short_12","alias_value":"OKHM3F2ZTYBW","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OKHM3F2ZTYBWWZV7","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OKHM3F2Z","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OKHM3F2ZTYBWWZV7RIX4EXEL5N","target":"record","payload":{"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"},"canonical_sha256":"728ecd97599e036b66bf8a2fc25c8beb620791d38adc7786d03164887af9fb33","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"},"source_kind":"arxiv","source_id":"1212.3889","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:38:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KPV/lvBCH9Ck8RPQfV6HhYdO0uk75L35fvm0+7BkZdfIJWverahyZUOqzsZhTYVDFxlzE5SabxRymTUVRVorBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T15:06:17.897459Z"},"content_sha256":"1d826b637252819bfe4169e241463e894d30e523e6be509548ea1cb70f578e3b","schema_version":"1.0","event_id":"sha256:1d826b637252819bfe4169e241463e894d30e523e6be509548ea1cb70f578e3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OKHM3F2ZTYBWWZV7RIX4EXEL5N","target":"graph","payload":{"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"},"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:38:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ht1dPaaO9KOiVdAALFIVpI3FqMq9oIBkUU9jYJ03Q6yB0pemzaFc3TeLwdEHeAjF2OHCz1JD1N2f8nRj8IB4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T15:06:17.897805Z"},"content_sha256":"115db3db9970409c25628bdcf7b57c1d0ce76ac13a1b484c17809035cfbcc807","schema_version":"1.0","event_id":"sha256:115db3db9970409c25628bdcf7b57c1d0ce76ac13a1b484c17809035cfbcc807"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OKHM3F2ZTYBWWZV7RIX4EXEL5N/bundle.json","state_url":"https://pith.science/pith/OKHM3F2ZTYBWWZV7RIX4EXEL5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OKHM3F2ZTYBWWZV7RIX4EXEL5N/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-06-26T15:06:17Z","links":{"resolver":"https://pith.science/pith/OKHM3F2ZTYBWWZV7RIX4EXEL5N","bundle":"https://pith.science/pith/OKHM3F2ZTYBWWZV7RIX4EXEL5N/bundle.json","state":"https://pith.science/pith/OKHM3F2ZTYBWWZV7RIX4EXEL5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OKHM3F2ZTYBWWZV7RIX4EXEL5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OKHM3F2ZTYBWWZV7RIX4EXEL5N","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":"20407988755a5d1757a6fa5850b6137e75591010b6db4a77be9296bae6d58888","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-17T05:28:46Z","title_canon_sha256":"a1bec476d8a37e8bbe29e5ffb7708e75ad5fc4893f1aa8c36bd55b9817083136"},"schema_version":"1.0","source":{"id":"1212.3889","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3889","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3889v1","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3889","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"pith_short_12","alias_value":"OKHM3F2ZTYBW","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OKHM3F2ZTYBWWZV7","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OKHM3F2Z","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:115db3db9970409c25628bdcf7b57c1d0ce76ac13a1b484c17809035cfbcc807","target":"graph","created_at":"2026-05-18T03:38:22Z","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":"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","authors_text":"Pawan Aurora, Shashank K. Mehta, Sumit Singh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-17T05:28:46Z","title":"Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3889","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:1d826b637252819bfe4169e241463e894d30e523e6be509548ea1cb70f578e3b","target":"record","created_at":"2026-05-18T03:38:22Z","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":"20407988755a5d1757a6fa5850b6137e75591010b6db4a77be9296bae6d58888","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-17T05:28:46Z","title_canon_sha256":"a1bec476d8a37e8bbe29e5ffb7708e75ad5fc4893f1aa8c36bd55b9817083136"},"schema_version":"1.0","source":{"id":"1212.3889","kind":"arxiv","version":1}},"canonical_sha256":"728ecd97599e036b66bf8a2fc25c8beb620791d38adc7786d03164887af9fb33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"728ecd97599e036b66bf8a2fc25c8beb620791d38adc7786d03164887af9fb33","first_computed_at":"2026-05-18T03:38:22.146067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:22.146067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3UIRWQSK1OkRfRB/fw4laf3BzQ5rXE78k4IZyFtP/0yQG+5z/5Q42mNeiF3IRdtpXgchESfcerAAPmP+X7frBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:22.146794Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.3889","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d826b637252819bfe4169e241463e894d30e523e6be509548ea1cb70f578e3b","sha256:115db3db9970409c25628bdcf7b57c1d0ce76ac13a1b484c17809035cfbcc807"],"state_sha256":"3b12e403e0d8ee20841011e5d2e6a2ec3dd3a24249fa75af1c25fc0d99a2da9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"59U6K66eCWy3bfOntdLIRbesWuGoKAFEzT5LjrBBnFsT/R/9HlfPzLg71xiR19DIRhTKamjbwEemGEY7ivN0Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T15:06:17.899718Z","bundle_sha256":"001b1e55b4a5758893cb23656ca13f8d574f506f55c4069d41f12ff198a0093c"}}