{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OJI55KDKLXUGPOMK6FIDBY26SD","short_pith_number":"pith:OJI55KDK","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"},"canonical_sha256":"7251dea86a5de867b98af15030e35e90d8db5194a5e2ad556534e80c9373326f","source":{"kind":"arxiv","id":"1601.03676","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03676","created_at":"2026-05-18T01:22:52Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03676v1","created_at":"2026-05-18T01:22:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03676","created_at":"2026-05-18T01:22:52Z"},{"alias_kind":"pith_short_12","alias_value":"OJI55KDKLXUG","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OJI55KDKLXUGPOMK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OJI55KDK","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OJI55KDKLXUGPOMK6FIDBY26SD","target":"record","payload":{"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"},"canonical_sha256":"7251dea86a5de867b98af15030e35e90d8db5194a5e2ad556534e80c9373326f","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"},"source_kind":"arxiv","source_id":"1601.03676","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-18T01:22:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hAILHDsCJ4WtKm0VSf01dXhI0svyLUenFhtbyUfWgEzHQEgD4Sr8MTVOdSG/qBQmGPUXXEbSyphadMK7QF5LAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:59:48.674196Z"},"content_sha256":"9473049216a2d919aec73a923fc52042c984942ecf596bd9302b5a7e2f85f85f","schema_version":"1.0","event_id":"sha256:9473049216a2d919aec73a923fc52042c984942ecf596bd9302b5a7e2f85f85f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OJI55KDKLXUGPOMK6FIDBY26SD","target":"graph","payload":{"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"},"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-18T01:22:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8NOKvMiyLIKe+pf/gMwF861SiByGHAKWTPrslykKo8MWzMK1CMDixW08gf0gdYvea+T6oKwcYdbgTkn4WqZwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:59:48.674580Z"},"content_sha256":"139bf03c0030fddc6ead6db8ed7cb0233eabad45dc8814de6ff2511290f7e2e3","schema_version":"1.0","event_id":"sha256:139bf03c0030fddc6ead6db8ed7cb0233eabad45dc8814de6ff2511290f7e2e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OJI55KDKLXUGPOMK6FIDBY26SD/bundle.json","state_url":"https://pith.science/pith/OJI55KDKLXUGPOMK6FIDBY26SD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OJI55KDKLXUGPOMK6FIDBY26SD/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-27T20:59:48Z","links":{"resolver":"https://pith.science/pith/OJI55KDKLXUGPOMK6FIDBY26SD","bundle":"https://pith.science/pith/OJI55KDKLXUGPOMK6FIDBY26SD/bundle.json","state":"https://pith.science/pith/OJI55KDKLXUGPOMK6FIDBY26SD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OJI55KDKLXUGPOMK6FIDBY26SD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OJI55KDKLXUGPOMK6FIDBY26SD","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":"e3863942434ba18c638d487b7ee1cbef94d5a5162247951da47071e9f66ded3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-14T17:31:55Z","title_canon_sha256":"58fbf669389a8e0dbecdcb22c7ae1bd62d01b12d0ae76017a0145a8b232f2db7"},"schema_version":"1.0","source":{"id":"1601.03676","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03676","created_at":"2026-05-18T01:22:52Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03676v1","created_at":"2026-05-18T01:22:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03676","created_at":"2026-05-18T01:22:52Z"},{"alias_kind":"pith_short_12","alias_value":"OJI55KDKLXUG","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OJI55KDKLXUGPOMK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OJI55KDK","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:139bf03c0030fddc6ead6db8ed7cb0233eabad45dc8814de6ff2511290f7e2e3","target":"graph","created_at":"2026-05-18T01:22: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":"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: (","authors_text":"Alejandro L\\'opez-Ortiz, Jazm\\'in Romero","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-14T17:31:55Z","title":"Arbitrary Overlap Constraints in Graph Packing Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03676","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:9473049216a2d919aec73a923fc52042c984942ecf596bd9302b5a7e2f85f85f","target":"record","created_at":"2026-05-18T01:22: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":"e3863942434ba18c638d487b7ee1cbef94d5a5162247951da47071e9f66ded3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-14T17:31:55Z","title_canon_sha256":"58fbf669389a8e0dbecdcb22c7ae1bd62d01b12d0ae76017a0145a8b232f2db7"},"schema_version":"1.0","source":{"id":"1601.03676","kind":"arxiv","version":1}},"canonical_sha256":"7251dea86a5de867b98af15030e35e90d8db5194a5e2ad556534e80c9373326f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7251dea86a5de867b98af15030e35e90d8db5194a5e2ad556534e80c9373326f","first_computed_at":"2026-05-18T01:22:52.871163Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:52.871163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WBiT//VxauuZiBZlsaa0I8T2Z5UX/dRt2P0Efav1lVjWkwZsISd5jjGrXBA2ooebO7THCz9jiqgDL/FQVC58DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:52.871815Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.03676","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9473049216a2d919aec73a923fc52042c984942ecf596bd9302b5a7e2f85f85f","sha256:139bf03c0030fddc6ead6db8ed7cb0233eabad45dc8814de6ff2511290f7e2e3"],"state_sha256":"add9d2a0508605159be47a33bcb461a0b75c449622ae178e342faba8b5f66552"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3JHP3A4r1sbb5ubEiZnKoZOjJiIF5t3sdg5/p+bdZnU7lKDKC80uUTqdlVR4fBkfnkNN3iK/TVlujBx4nFXoCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T20:59:48.676450Z","bundle_sha256":"817f6d30079505e97ac4dbda4aa142e205497bf594e22bc534d84ffe009c35af"}}