{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6NNNKIZKNMSWPQCBVEMYN2KUE2","short_pith_number":"pith:6NNNKIZK","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"},"canonical_sha256":"f35ad5232a6b2567c041a91986e95426ab8291275bbab319c9829b20eb879d53","source":{"kind":"arxiv","id":"1312.3215","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3215","created_at":"2026-05-18T01:22:58Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3215v2","created_at":"2026-05-18T01:22:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3215","created_at":"2026-05-18T01:22:58Z"},{"alias_kind":"pith_short_12","alias_value":"6NNNKIZKNMSW","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6NNNKIZKNMSWPQCB","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6NNNKIZK","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6NNNKIZKNMSWPQCBVEMYN2KUE2","target":"record","payload":{"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"},"canonical_sha256":"f35ad5232a6b2567c041a91986e95426ab8291275bbab319c9829b20eb879d53","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"},"source_kind":"arxiv","source_id":"1312.3215","source_version":2,"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:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f5wxIjBbL7Pm/JP88lGgPOnRwcaE08qF/F0rz0h1DBw8WRbFXfRKaK1V7Vh9k8XF4jg8Hgd/+1zIQM24aSSrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:41:01.212996Z"},"content_sha256":"963d51e3484fd550d1653ea68788e501d70fb74511438e7a80a1b68447048aea","schema_version":"1.0","event_id":"sha256:963d51e3484fd550d1653ea68788e501d70fb74511438e7a80a1b68447048aea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6NNNKIZKNMSWPQCBVEMYN2KUE2","target":"graph","payload":{"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"},"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:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ULyQDhxvz2ubJpMAKrT/lBWDwgzuymoRZcfqzb5KufUtfXeAYRNHXFq+ZJ6gBKpnPgJwdjadFMxk8lxnAo92Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:41:01.213367Z"},"content_sha256":"a418d12cca177c04681b6101574a163e4e799ecc3f3cbbbd31ccb0a410909057","schema_version":"1.0","event_id":"sha256:a418d12cca177c04681b6101574a163e4e799ecc3f3cbbbd31ccb0a410909057"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6NNNKIZKNMSWPQCBVEMYN2KUE2/bundle.json","state_url":"https://pith.science/pith/6NNNKIZKNMSWPQCBVEMYN2KUE2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6NNNKIZKNMSWPQCBVEMYN2KUE2/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-05-31T08:41:01Z","links":{"resolver":"https://pith.science/pith/6NNNKIZKNMSWPQCBVEMYN2KUE2","bundle":"https://pith.science/pith/6NNNKIZKNMSWPQCBVEMYN2KUE2/bundle.json","state":"https://pith.science/pith/6NNNKIZKNMSWPQCBVEMYN2KUE2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6NNNKIZKNMSWPQCBVEMYN2KUE2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6NNNKIZKNMSWPQCBVEMYN2KUE2","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":"208c2781091328642cf9e96c094d13636bb314422143ae99c4b9cb1c2bd4d70d","cross_cats_sorted":["cs.CG","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2013-12-09T14:47:29Z","title_canon_sha256":"254fa4c674f1bd087b927377fd20a212d83123db37b759339f51baf37865711c"},"schema_version":"1.0","source":{"id":"1312.3215","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3215","created_at":"2026-05-18T01:22:58Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3215v2","created_at":"2026-05-18T01:22:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3215","created_at":"2026-05-18T01:22:58Z"},{"alias_kind":"pith_short_12","alias_value":"6NNNKIZKNMSW","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6NNNKIZKNMSWPQCB","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6NNNKIZK","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:a418d12cca177c04681b6101574a163e4e799ecc3f3cbbbd31ccb0a410909057","target":"graph","created_at":"2026-05-18T01:22:58Z","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":"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","authors_text":"Bartosz Walczak, J\\'anos Pach","cross_cats":["cs.CG","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2013-12-09T14:47:29Z","title":"Decomposition of multiple packings with subquadratic union complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3215","kind":"arxiv","version":2},"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:963d51e3484fd550d1653ea68788e501d70fb74511438e7a80a1b68447048aea","target":"record","created_at":"2026-05-18T01:22:58Z","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":"208c2781091328642cf9e96c094d13636bb314422143ae99c4b9cb1c2bd4d70d","cross_cats_sorted":["cs.CG","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2013-12-09T14:47:29Z","title_canon_sha256":"254fa4c674f1bd087b927377fd20a212d83123db37b759339f51baf37865711c"},"schema_version":"1.0","source":{"id":"1312.3215","kind":"arxiv","version":2}},"canonical_sha256":"f35ad5232a6b2567c041a91986e95426ab8291275bbab319c9829b20eb879d53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f35ad5232a6b2567c041a91986e95426ab8291275bbab319c9829b20eb879d53","first_computed_at":"2026-05-18T01:22:58.539794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:58.539794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LbYGGiqyKqQ2CgtTCfnlFesc6W6MbTS3pVhVnH62lJAVVFK67RlG6j1vgxOBEGonUpWZ/2qz3XGmBG957obsCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:58.540359Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3215","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:963d51e3484fd550d1653ea68788e501d70fb74511438e7a80a1b68447048aea","sha256:a418d12cca177c04681b6101574a163e4e799ecc3f3cbbbd31ccb0a410909057"],"state_sha256":"6545bb320f722074f4c10c7e2804538a560cd3100598b73d5e6d428afb1c2cb1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HddcbjJuNqSQUJxdS95INpBkhXPQ0179eBty48ZcKaSlUgV+5+iDZ55lMSyPi5LC88IpXAlRD1dlaMLGBuUsDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:41:01.215353Z","bundle_sha256":"fa3a329baf17ca9bc7b5b8ba4e4614a2404416a3079c19292b42a8df3bd675aa"}}