{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XJOVKR4Z4J5O6IN66WXRES5L5R","short_pith_number":"pith:XJOVKR4Z","canonical_record":{"source":{"id":"1103.5560","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-03-29T07:53:17Z","cross_cats_sorted":[],"title_canon_sha256":"58f619ef4575c14364f0fff50ce144e8bb2ff0c7b7b167903e2612b122db41a7","abstract_canon_sha256":"ea1a53edeaa9bc1a3334bf6a01e90e9a9134f4a98a908c2040d2316ac6ed95be"},"schema_version":"1.0"},"canonical_sha256":"ba5d554799e27aef21bef5af124babec4c89b52479461ae4bee7a8b48ebf43c4","source":{"kind":"arxiv","id":"1103.5560","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5560","created_at":"2026-05-18T04:24:52Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5560v2","created_at":"2026-05-18T04:24:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5560","created_at":"2026-05-18T04:24:52Z"},{"alias_kind":"pith_short_12","alias_value":"XJOVKR4Z4J5O","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XJOVKR4Z4J5O6IN6","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XJOVKR4Z","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XJOVKR4Z4J5O6IN66WXRES5L5R","target":"record","payload":{"canonical_record":{"source":{"id":"1103.5560","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-03-29T07:53:17Z","cross_cats_sorted":[],"title_canon_sha256":"58f619ef4575c14364f0fff50ce144e8bb2ff0c7b7b167903e2612b122db41a7","abstract_canon_sha256":"ea1a53edeaa9bc1a3334bf6a01e90e9a9134f4a98a908c2040d2316ac6ed95be"},"schema_version":"1.0"},"canonical_sha256":"ba5d554799e27aef21bef5af124babec4c89b52479461ae4bee7a8b48ebf43c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:52.688140Z","signature_b64":"uSMVabt3PtLg/jgMgZDt1AgpcYEgHVmOzXWV/KNoLuqU/1dtOYs4P9MQL7dg0CF3jq6WGLFqsjIdoYDEWbnjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba5d554799e27aef21bef5af124babec4c89b52479461ae4bee7a8b48ebf43c4","last_reissued_at":"2026-05-18T04:24:52.687595Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:52.687595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.5560","source_version":2,"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-18T04:24:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l4dSjpwMHp/8roAnx+O9irBvavrszGjv/TvWMJByKfl0sfkYFT/ybegU6vBmZ4LtrZ44RCI5HwT1wqB4HVecAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:13:19.721793Z"},"content_sha256":"94d1d39a04f853069c50e607be224c5ceb2f20d51725323c8394d6239c7416c7","schema_version":"1.0","event_id":"sha256:94d1d39a04f853069c50e607be224c5ceb2f20d51725323c8394d6239c7416c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XJOVKR4Z4J5O6IN66WXRES5L5R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Edge Packing and Vertex Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"K. Murali Krishnan, K. N. Parvathy, K. S. Sudeep, Sameera Muhamed Salam","submitted_at":"2011-03-29T07:53:17Z","abstract_excerpt":"This paper studies the computational complexity of the Edge Packing problem and the Vertex Packing problem. The edge packing problem (denoted by $\\bar{EDS}$) and the vertex packing problem (denoted by $\\bar{DS} $) are linear programming duals of the edge dominating set problem and the dominating set problem respectively. It is shown that these two problems are equivalent to the set packing problem with respect to hardness of approximation and parametric complexity. It follows that $\\bar{EDS}$ and $\\bar{DS}$ cannot be approximated asymptotically within a factor of $O(N^{1/2-\\epsilon})$ for any "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5560","kind":"arxiv","version":2},"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-18T04:24:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xskE0v0BSjAR7chpjzeDlv2zKef6/XBGhMrAoKDO14hdnPTGDuMVKudPceH1MXhBSNiF0g5VzmRadfVSTlzwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:13:19.722131Z"},"content_sha256":"1e8528f3159f19679c4fe8bf38bb78d05caa8ba89978a73853d1ed7341222e84","schema_version":"1.0","event_id":"sha256:1e8528f3159f19679c4fe8bf38bb78d05caa8ba89978a73853d1ed7341222e84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XJOVKR4Z4J5O6IN66WXRES5L5R/bundle.json","state_url":"https://pith.science/pith/XJOVKR4Z4J5O6IN66WXRES5L5R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XJOVKR4Z4J5O6IN66WXRES5L5R/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-02T10:13:19Z","links":{"resolver":"https://pith.science/pith/XJOVKR4Z4J5O6IN66WXRES5L5R","bundle":"https://pith.science/pith/XJOVKR4Z4J5O6IN66WXRES5L5R/bundle.json","state":"https://pith.science/pith/XJOVKR4Z4J5O6IN66WXRES5L5R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XJOVKR4Z4J5O6IN66WXRES5L5R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XJOVKR4Z4J5O6IN66WXRES5L5R","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":"ea1a53edeaa9bc1a3334bf6a01e90e9a9134f4a98a908c2040d2316ac6ed95be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-03-29T07:53:17Z","title_canon_sha256":"58f619ef4575c14364f0fff50ce144e8bb2ff0c7b7b167903e2612b122db41a7"},"schema_version":"1.0","source":{"id":"1103.5560","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5560","created_at":"2026-05-18T04:24:52Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5560v2","created_at":"2026-05-18T04:24:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5560","created_at":"2026-05-18T04:24:52Z"},{"alias_kind":"pith_short_12","alias_value":"XJOVKR4Z4J5O","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XJOVKR4Z4J5O6IN6","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XJOVKR4Z","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:1e8528f3159f19679c4fe8bf38bb78d05caa8ba89978a73853d1ed7341222e84","target":"graph","created_at":"2026-05-18T04:24:52Z","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":"This paper studies the computational complexity of the Edge Packing problem and the Vertex Packing problem. The edge packing problem (denoted by $\\bar{EDS}$) and the vertex packing problem (denoted by $\\bar{DS} $) are linear programming duals of the edge dominating set problem and the dominating set problem respectively. It is shown that these two problems are equivalent to the set packing problem with respect to hardness of approximation and parametric complexity. It follows that $\\bar{EDS}$ and $\\bar{DS}$ cannot be approximated asymptotically within a factor of $O(N^{1/2-\\epsilon})$ for any ","authors_text":"K. Murali Krishnan, K. N. Parvathy, K. S. Sudeep, Sameera Muhamed Salam","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-03-29T07:53:17Z","title":"On the Complexity of Edge Packing and Vertex Packing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5560","kind":"arxiv","version":2},"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:94d1d39a04f853069c50e607be224c5ceb2f20d51725323c8394d6239c7416c7","target":"record","created_at":"2026-05-18T04:24:52Z","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":"ea1a53edeaa9bc1a3334bf6a01e90e9a9134f4a98a908c2040d2316ac6ed95be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-03-29T07:53:17Z","title_canon_sha256":"58f619ef4575c14364f0fff50ce144e8bb2ff0c7b7b167903e2612b122db41a7"},"schema_version":"1.0","source":{"id":"1103.5560","kind":"arxiv","version":2}},"canonical_sha256":"ba5d554799e27aef21bef5af124babec4c89b52479461ae4bee7a8b48ebf43c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba5d554799e27aef21bef5af124babec4c89b52479461ae4bee7a8b48ebf43c4","first_computed_at":"2026-05-18T04:24:52.687595Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:52.687595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uSMVabt3PtLg/jgMgZDt1AgpcYEgHVmOzXWV/KNoLuqU/1dtOYs4P9MQL7dg0CF3jq6WGLFqsjIdoYDEWbnjAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:52.688140Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.5560","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94d1d39a04f853069c50e607be224c5ceb2f20d51725323c8394d6239c7416c7","sha256:1e8528f3159f19679c4fe8bf38bb78d05caa8ba89978a73853d1ed7341222e84"],"state_sha256":"f5b88a9bc9e6e5b4239cdc2ccb9a26555fbb9e0c9f7112493a157cabe9bbd4a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rfa9JsAm3+HnO+N1SKpB8JXUuVqG2vWLXeXFVEnaEWbLwlLFmsRBVZIP955P5ETJ6YxFweOJhgSmx/QwfDxBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:13:19.724076Z","bundle_sha256":"d540323d46911dba0f6fa28f32b225c4c4288ab1c78936b97f2c2b59f0c38f5b"}}