{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:R722BLK6OS2SWFY2RV2X3YZDI6","short_pith_number":"pith:R722BLK6","schema_version":"1.0","canonical_sha256":"8ff5a0ad5e74b52b171a8d757de32347b75fd82ec23f2c1d62dc2329ff8d7e28","source":{"kind":"arxiv","id":"1411.6915","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.6915","created_at":"2026-05-18T02:28:41.172342+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6915v3","created_at":"2026-05-18T02:28:41.172342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6915","created_at":"2026-05-18T02:28:41.172342+00:00"},{"alias_kind":"pith_short_12","alias_value":"R722BLK6OS2S","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"R722BLK6OS2SWFY2","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"R722BLK6","created_at":"2026-05-18T12:28:46.137349+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/R722BLK6OS2SWFY2RV2X3YZDI6","json":"https://pith.science/pith/R722BLK6OS2SWFY2RV2X3YZDI6.json","graph_json":"https://pith.science/api/pith-number/R722BLK6OS2SWFY2RV2X3YZDI6/graph.json","events_json":"https://pith.science/api/pith-number/R722BLK6OS2SWFY2RV2X3YZDI6/events.json","paper":"https://pith.science/paper/R722BLK6"},"agent_actions":{"view_html":"https://pith.science/pith/R722BLK6OS2SWFY2RV2X3YZDI6","download_json":"https://pith.science/pith/R722BLK6OS2SWFY2RV2X3YZDI6.json","view_paper":"https://pith.science/paper/R722BLK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6915&json=true","fetch_graph":"https://pith.science/api/pith-number/R722BLK6OS2SWFY2RV2X3YZDI6/graph.json","fetch_events":"https://pith.science/api/pith-number/R722BLK6OS2SWFY2RV2X3YZDI6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R722BLK6OS2SWFY2RV2X3YZDI6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R722BLK6OS2SWFY2RV2X3YZDI6/action/storage_attestation","attest_author":"https://pith.science/pith/R722BLK6OS2SWFY2RV2X3YZDI6/action/author_attestation","sign_citation":"https://pith.science/pith/R722BLK6OS2SWFY2RV2X3YZDI6/action/citation_signature","submit_replication":"https://pith.science/pith/R722BLK6OS2SWFY2RV2X3YZDI6/action/replication_record"}},"created_at":"2026-05-18T02:28:41.172342+00:00","updated_at":"2026-05-18T02:28:41.172342+00:00"}