{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OJI55KDKLXUGPOMK6FIDBY26SD","short_pith_number":"pith:OJI55KDK","schema_version":"1.0","canonical_sha256":"7251dea86a5de867b98af15030e35e90d8db5194a5e2ad556534e80c9373326f","source":{"kind":"arxiv","id":"1601.03676","version":1},"attestation_state":"computed","paper":{"title":"Arbitrary Overlap Constraints in Graph Packing Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alejandro L\\'opez-Ortiz, Jazm\\'in Romero","submitted_at":"2016-01-14T17:31:55Z","abstract_excerpt":"In earlier versions of the community discovering problem, the overlap between communities was restricted by a simple count upper-bound [17,5,11,8]. In this paper, we introduce the $\\Pi$-Packing with $\\alpha()$-Overlap problem to allow for more complex constraints in the overlap region than those previously studied. Let $\\mathcal{V}^r$ be all possible subsets of vertices of $V(G)$ each of size at most $r$, and $\\alpha: \\mathcal{V}^r \\times \\mathcal{V}^r \\to \\{0,1\\}$ be a function. The $\\Pi$-Packing with $\\alpha()$-Overlap problem seeks at least $k$ induced subgraphs in a graph $G$ subject to: ("},"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":"1601.03676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-14T17:31:55Z","cross_cats_sorted":[],"title_canon_sha256":"58fbf669389a8e0dbecdcb22c7ae1bd62d01b12d0ae76017a0145a8b232f2db7","abstract_canon_sha256":"e3863942434ba18c638d487b7ee1cbef94d5a5162247951da47071e9f66ded3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:52.871815Z","signature_b64":"WBiT//VxauuZiBZlsaa0I8T2Z5UX/dRt2P0Efav1lVjWkwZsISd5jjGrXBA2ooebO7THCz9jiqgDL/FQVC58DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7251dea86a5de867b98af15030e35e90d8db5194a5e2ad556534e80c9373326f","last_reissued_at":"2026-05-18T01:22:52.871163Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:52.871163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Arbitrary Overlap Constraints in Graph Packing Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alejandro L\\'opez-Ortiz, Jazm\\'in Romero","submitted_at":"2016-01-14T17:31:55Z","abstract_excerpt":"In earlier versions of the community discovering problem, the overlap between communities was restricted by a simple count upper-bound [17,5,11,8]. In this paper, we introduce the $\\Pi$-Packing with $\\alpha()$-Overlap problem to allow for more complex constraints in the overlap region than those previously studied. Let $\\mathcal{V}^r$ be all possible subsets of vertices of $V(G)$ each of size at most $r$, and $\\alpha: \\mathcal{V}^r \\times \\mathcal{V}^r \\to \\{0,1\\}$ be a function. The $\\Pi$-Packing with $\\alpha()$-Overlap problem seeks at least $k$ induced subgraphs in a graph $G$ subject to: ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03676","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":"1601.03676","created_at":"2026-05-18T01:22:52.871251+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.03676v1","created_at":"2026-05-18T01:22:52.871251+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03676","created_at":"2026-05-18T01:22:52.871251+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJI55KDKLXUG","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJI55KDKLXUGPOMK","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJI55KDK","created_at":"2026-05-18T12:30:36.002864+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/OJI55KDKLXUGPOMK6FIDBY26SD","json":"https://pith.science/pith/OJI55KDKLXUGPOMK6FIDBY26SD.json","graph_json":"https://pith.science/api/pith-number/OJI55KDKLXUGPOMK6FIDBY26SD/graph.json","events_json":"https://pith.science/api/pith-number/OJI55KDKLXUGPOMK6FIDBY26SD/events.json","paper":"https://pith.science/paper/OJI55KDK"},"agent_actions":{"view_html":"https://pith.science/pith/OJI55KDKLXUGPOMK6FIDBY26SD","download_json":"https://pith.science/pith/OJI55KDKLXUGPOMK6FIDBY26SD.json","view_paper":"https://pith.science/paper/OJI55KDK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.03676&json=true","fetch_graph":"https://pith.science/api/pith-number/OJI55KDKLXUGPOMK6FIDBY26SD/graph.json","fetch_events":"https://pith.science/api/pith-number/OJI55KDKLXUGPOMK6FIDBY26SD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJI55KDKLXUGPOMK6FIDBY26SD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJI55KDKLXUGPOMK6FIDBY26SD/action/storage_attestation","attest_author":"https://pith.science/pith/OJI55KDKLXUGPOMK6FIDBY26SD/action/author_attestation","sign_citation":"https://pith.science/pith/OJI55KDKLXUGPOMK6FIDBY26SD/action/citation_signature","submit_replication":"https://pith.science/pith/OJI55KDKLXUGPOMK6FIDBY26SD/action/replication_record"}},"created_at":"2026-05-18T01:22:52.871251+00:00","updated_at":"2026-05-18T01:22:52.871251+00:00"}