{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:R722BLK6OS2SWFY2RV2X3YZDI6","short_pith_number":"pith:R722BLK6","canonical_record":{"source":{"id":"1411.6915","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-25T16:47:42Z","cross_cats_sorted":[],"title_canon_sha256":"9b381602b4a62bb8deb8f642d75625b553adb52b7cb31e806b00e83689dfaa8f","abstract_canon_sha256":"dd6b7a0a1ddd74331c99edea0c1797ba19e157b12bbc39ad4a16f5cc1dd18d09"},"schema_version":"1.0"},"canonical_sha256":"8ff5a0ad5e74b52b171a8d757de32347b75fd82ec23f2c1d62dc2329ff8d7e28","source":{"kind":"arxiv","id":"1411.6915","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6915","created_at":"2026-05-18T02:28:41Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6915v3","created_at":"2026-05-18T02:28:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6915","created_at":"2026-05-18T02:28:41Z"},{"alias_kind":"pith_short_12","alias_value":"R722BLK6OS2S","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"R722BLK6OS2SWFY2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"R722BLK6","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:R722BLK6OS2SWFY2RV2X3YZDI6","target":"record","payload":{"canonical_record":{"source":{"id":"1411.6915","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-25T16:47:42Z","cross_cats_sorted":[],"title_canon_sha256":"9b381602b4a62bb8deb8f642d75625b553adb52b7cb31e806b00e83689dfaa8f","abstract_canon_sha256":"dd6b7a0a1ddd74331c99edea0c1797ba19e157b12bbc39ad4a16f5cc1dd18d09"},"schema_version":"1.0"},"canonical_sha256":"8ff5a0ad5e74b52b171a8d757de32347b75fd82ec23f2c1d62dc2329ff8d7e28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:41.172687Z","signature_b64":"3d+AEssNaJy63Vhfsso1E2pe4rejk6r13Yb0Pvw8r+o6uYl4z6GYI28jzy711LBWuId3HVEbrKZMhl0jeuLSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ff5a0ad5e74b52b171a8d757de32347b75fd82ec23f2c1d62dc2329ff8d7e28","last_reissued_at":"2026-05-18T02:28:41.172277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:41.172277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.6915","source_version":3,"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-18T02:28:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R5RCZe3OFeEFkMfb0Q9xhrm5DPL0iUOZ6IQfHcyoT6hLrK1hxuV79NHed51qQ9Frmv+WoXIG0VAc2sEORf9xCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:31:27.338414Z"},"content_sha256":"638475aefb0224bb45ad18be22ce1f7fc060ad2b87524329c6f2d50450eb8d4c","schema_version":"1.0","event_id":"sha256:638475aefb0224bb45ad18be22ce1f7fc060ad2b87524329c6f2d50450eb8d4c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:R722BLK6OS2SWFY2RV2X3YZDI6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Kernelization Algorithms for Packing Problems Allowing Overlaps (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alejandro L\\'opez-Ortiz, Henning Fernau, Jazm\\'in Romero","submitted_at":"2014-11-25T16:47:42Z","abstract_excerpt":"We consider the problem of discovering overlapping communities in networks which we model as generalizations of Graph Packing problems with overlap.\n  We seek a collection $\\mathcal{S}' \\subseteq \\mathcal{S}$ consisting of at least $k$ sets subject to certain disjointness restrictions. In the $r$-Set Packing with $t$-Membership, each element of $\\mathcal{U}$ belongs to at most $t$ sets of $\\mathcal{S'}$ while in $t$-Overlap each pair of sets in $\\mathcal{S'}$ overlaps in at most $t$ elements. Each set of $\\mathcal{S}$ has at most $r$ elements.\n  Similarly, both of our graph packing problems se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6915","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":""},"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-18T02:28:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8eCHCI6ZjS8yWts6+8yYn/6da1HmSmjZSM4OdyiJcPAyk2dtDeTzrtpjoN6D0oIgvbiFAQehrXuEOVyd6U3jBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:31:27.338755Z"},"content_sha256":"679ab9ffe1a78968dbc1a9eedbdd8b650ceeaa38296640195ae1e6de2ad92caa","schema_version":"1.0","event_id":"sha256:679ab9ffe1a78968dbc1a9eedbdd8b650ceeaa38296640195ae1e6de2ad92caa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R722BLK6OS2SWFY2RV2X3YZDI6/bundle.json","state_url":"https://pith.science/pith/R722BLK6OS2SWFY2RV2X3YZDI6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R722BLK6OS2SWFY2RV2X3YZDI6/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-27T17:31:27Z","links":{"resolver":"https://pith.science/pith/R722BLK6OS2SWFY2RV2X3YZDI6","bundle":"https://pith.science/pith/R722BLK6OS2SWFY2RV2X3YZDI6/bundle.json","state":"https://pith.science/pith/R722BLK6OS2SWFY2RV2X3YZDI6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R722BLK6OS2SWFY2RV2X3YZDI6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:R722BLK6OS2SWFY2RV2X3YZDI6","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":"dd6b7a0a1ddd74331c99edea0c1797ba19e157b12bbc39ad4a16f5cc1dd18d09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-25T16:47:42Z","title_canon_sha256":"9b381602b4a62bb8deb8f642d75625b553adb52b7cb31e806b00e83689dfaa8f"},"schema_version":"1.0","source":{"id":"1411.6915","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6915","created_at":"2026-05-18T02:28:41Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6915v3","created_at":"2026-05-18T02:28:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6915","created_at":"2026-05-18T02:28:41Z"},{"alias_kind":"pith_short_12","alias_value":"R722BLK6OS2S","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"R722BLK6OS2SWFY2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"R722BLK6","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:679ab9ffe1a78968dbc1a9eedbdd8b650ceeaa38296640195ae1e6de2ad92caa","target":"graph","created_at":"2026-05-18T02:28:41Z","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 consider the problem of discovering overlapping communities in networks which we model as generalizations of Graph Packing problems with overlap.\n  We seek a collection $\\mathcal{S}' \\subseteq \\mathcal{S}$ consisting of at least $k$ sets subject to certain disjointness restrictions. In the $r$-Set Packing with $t$-Membership, each element of $\\mathcal{U}$ belongs to at most $t$ sets of $\\mathcal{S'}$ while in $t$-Overlap each pair of sets in $\\mathcal{S'}$ overlaps in at most $t$ elements. Each set of $\\mathcal{S}$ has at most $r$ elements.\n  Similarly, both of our graph packing problems se","authors_text":"Alejandro L\\'opez-Ortiz, Henning Fernau, Jazm\\'in Romero","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-25T16:47:42Z","title":"Kernelization Algorithms for Packing Problems Allowing Overlaps (Extended Version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6915","kind":"arxiv","version":3},"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:638475aefb0224bb45ad18be22ce1f7fc060ad2b87524329c6f2d50450eb8d4c","target":"record","created_at":"2026-05-18T02:28:41Z","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":"dd6b7a0a1ddd74331c99edea0c1797ba19e157b12bbc39ad4a16f5cc1dd18d09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-25T16:47:42Z","title_canon_sha256":"9b381602b4a62bb8deb8f642d75625b553adb52b7cb31e806b00e83689dfaa8f"},"schema_version":"1.0","source":{"id":"1411.6915","kind":"arxiv","version":3}},"canonical_sha256":"8ff5a0ad5e74b52b171a8d757de32347b75fd82ec23f2c1d62dc2329ff8d7e28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ff5a0ad5e74b52b171a8d757de32347b75fd82ec23f2c1d62dc2329ff8d7e28","first_computed_at":"2026-05-18T02:28:41.172277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:41.172277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3d+AEssNaJy63Vhfsso1E2pe4rejk6r13Yb0Pvw8r+o6uYl4z6GYI28jzy711LBWuId3HVEbrKZMhl0jeuLSCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:41.172687Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6915","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:638475aefb0224bb45ad18be22ce1f7fc060ad2b87524329c6f2d50450eb8d4c","sha256:679ab9ffe1a78968dbc1a9eedbdd8b650ceeaa38296640195ae1e6de2ad92caa"],"state_sha256":"c4feadf1d983aa1183f91462bc130f5e408078bcee86a56f0efe7203ed83271e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZsSKM1J7OYlSmFsFVlKj/t20sDja2q73hK5hKX5o3PaNlS2cnaEX3Pcvi8peHzp4Ao2KFEezkGas6yO9bsA0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T17:31:27.340571Z","bundle_sha256":"82435aba5a99fdff82775c2637e76dd2af56777f62aac6a4dff9e4eef2ca3012"}}