{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6NNNKIZKNMSWPQCBVEMYN2KUE2","short_pith_number":"pith:6NNNKIZK","schema_version":"1.0","canonical_sha256":"f35ad5232a6b2567c041a91986e95426ab8291275bbab319c9829b20eb879d53","source":{"kind":"arxiv","id":"1312.3215","version":2},"attestation_state":"computed","paper":{"title":"Decomposition of multiple packings with subquadratic union complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM","math.CO"],"primary_cat":"math.MG","authors_text":"Bartosz Walczak, J\\'anos Pach","submitted_at":"2013-12-09T14:47:29Z","abstract_excerpt":"Suppose $k$ is a positive integer and $\\mathcal{X}$ is a $k$-fold packing of the plane by infinitely many arc-connected compact sets, which means that every point of the plane belongs to at most $k$ sets. Suppose there is a function $f(n)=o(n^2)$ with the property that any $n$ members of $\\mathcal{X}$ determine at most $f(n)$ holes, which means that the complement of their union has at most $f(n)$ bounded connected components. We use tools from extremal graph theory and the topological Helly theorem to prove that $\\mathcal{X}$ can be decomposed into at most $p$ ($1$-fold) packings, where $p$ i"},"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":"1312.3215","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2013-12-09T14:47:29Z","cross_cats_sorted":["cs.CG","cs.DM","math.CO"],"title_canon_sha256":"254fa4c674f1bd087b927377fd20a212d83123db37b759339f51baf37865711c","abstract_canon_sha256":"208c2781091328642cf9e96c094d13636bb314422143ae99c4b9cb1c2bd4d70d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:58.540359Z","signature_b64":"LbYGGiqyKqQ2CgtTCfnlFesc6W6MbTS3pVhVnH62lJAVVFK67RlG6j1vgxOBEGonUpWZ/2qz3XGmBG957obsCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f35ad5232a6b2567c041a91986e95426ab8291275bbab319c9829b20eb879d53","last_reissued_at":"2026-05-18T01:22:58.539794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:58.539794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposition of multiple packings with subquadratic union complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM","math.CO"],"primary_cat":"math.MG","authors_text":"Bartosz Walczak, J\\'anos Pach","submitted_at":"2013-12-09T14:47:29Z","abstract_excerpt":"Suppose $k$ is a positive integer and $\\mathcal{X}$ is a $k$-fold packing of the plane by infinitely many arc-connected compact sets, which means that every point of the plane belongs to at most $k$ sets. Suppose there is a function $f(n)=o(n^2)$ with the property that any $n$ members of $\\mathcal{X}$ determine at most $f(n)$ holes, which means that the complement of their union has at most $f(n)$ bounded connected components. We use tools from extremal graph theory and the topological Helly theorem to prove that $\\mathcal{X}$ can be decomposed into at most $p$ ($1$-fold) packings, where $p$ i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3215","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.3215","created_at":"2026-05-18T01:22:58.539866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.3215v2","created_at":"2026-05-18T01:22:58.539866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3215","created_at":"2026-05-18T01:22:58.539866+00:00"},{"alias_kind":"pith_short_12","alias_value":"6NNNKIZKNMSW","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6NNNKIZKNMSWPQCB","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6NNNKIZK","created_at":"2026-05-18T12:27:36.564083+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/6NNNKIZKNMSWPQCBVEMYN2KUE2","json":"https://pith.science/pith/6NNNKIZKNMSWPQCBVEMYN2KUE2.json","graph_json":"https://pith.science/api/pith-number/6NNNKIZKNMSWPQCBVEMYN2KUE2/graph.json","events_json":"https://pith.science/api/pith-number/6NNNKIZKNMSWPQCBVEMYN2KUE2/events.json","paper":"https://pith.science/paper/6NNNKIZK"},"agent_actions":{"view_html":"https://pith.science/pith/6NNNKIZKNMSWPQCBVEMYN2KUE2","download_json":"https://pith.science/pith/6NNNKIZKNMSWPQCBVEMYN2KUE2.json","view_paper":"https://pith.science/paper/6NNNKIZK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.3215&json=true","fetch_graph":"https://pith.science/api/pith-number/6NNNKIZKNMSWPQCBVEMYN2KUE2/graph.json","fetch_events":"https://pith.science/api/pith-number/6NNNKIZKNMSWPQCBVEMYN2KUE2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6NNNKIZKNMSWPQCBVEMYN2KUE2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6NNNKIZKNMSWPQCBVEMYN2KUE2/action/storage_attestation","attest_author":"https://pith.science/pith/6NNNKIZKNMSWPQCBVEMYN2KUE2/action/author_attestation","sign_citation":"https://pith.science/pith/6NNNKIZKNMSWPQCBVEMYN2KUE2/action/citation_signature","submit_replication":"https://pith.science/pith/6NNNKIZKNMSWPQCBVEMYN2KUE2/action/replication_record"}},"created_at":"2026-05-18T01:22:58.539866+00:00","updated_at":"2026-05-18T01:22:58.539866+00:00"}