{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LLPR5WV6EOTU2XIOPGQDRLTOQO","short_pith_number":"pith:LLPR5WV6","canonical_record":{"source":{"id":"1901.09185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-26T09:44:01Z","cross_cats_sorted":[],"title_canon_sha256":"dff5a1e6433b3234c53185f031b9167ad97a70ec315d2bf1193ded107c387125","abstract_canon_sha256":"b59e4d6975e0044dc56a447a082c27041086550d2ae4da7e1208033e329c78c6"},"schema_version":"1.0"},"canonical_sha256":"5adf1edabe23a74d5d0e79a038ae6e83a6d2bf2931cb33f761f61b9f56ed9a5c","source":{"kind":"arxiv","id":"1901.09185","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09185","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09185v1","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09185","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"pith_short_12","alias_value":"LLPR5WV6EOTU","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LLPR5WV6EOTU2XIO","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LLPR5WV6","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LLPR5WV6EOTU2XIOPGQDRLTOQO","target":"record","payload":{"canonical_record":{"source":{"id":"1901.09185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-26T09:44:01Z","cross_cats_sorted":[],"title_canon_sha256":"dff5a1e6433b3234c53185f031b9167ad97a70ec315d2bf1193ded107c387125","abstract_canon_sha256":"b59e4d6975e0044dc56a447a082c27041086550d2ae4da7e1208033e329c78c6"},"schema_version":"1.0"},"canonical_sha256":"5adf1edabe23a74d5d0e79a038ae6e83a6d2bf2931cb33f761f61b9f56ed9a5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:26.668772Z","signature_b64":"6rHDoNMkqknC5RGh78mrDN8+VDZnP7I9hGvqEw5QpIvJWgiwPGAW0tDI+qS3MQ9JM0WNOH9KZfrDMMzDqgm0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5adf1edabe23a74d5d0e79a038ae6e83a6d2bf2931cb33f761f61b9f56ed9a5c","last_reissued_at":"2026-05-17T23:55:26.668393Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:26.668393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.09185","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-17T23:55:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4bjmdBiuNTHcqkwAQIo9uPweXjy5kIhK2CuuCXmQN3bHZgKgGwdea+XkT0/nyawErV0ZwvblhJGXlW/MeZjMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:09:07.243637Z"},"content_sha256":"9564e4621dd0fbfa31e69cf1d04d8e06d03daa292b8d9cad7bb618072571e049","schema_version":"1.0","event_id":"sha256:9564e4621dd0fbfa31e69cf1d04d8e06d03daa292b8d9cad7bb618072571e049"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LLPR5WV6EOTU2XIOPGQDRLTOQO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Packing without some pieces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Raphael Yuster","submitted_at":"2019-01-26T09:44:01Z","abstract_excerpt":"Erd\\H{o}s and Hanani proved that for every fixed integer $k \\ge 2$, the complete graph $K_n$ can be almost completely packed with copies of $K_k$; that is, $K_n$ contains pairwise edge-disjoint copies of $K_k$ that cover all but an $o_n(1)$ fraction of its edges. Equivalently, elements of the set $\\C(k)$ of all red-blue edge colorings of $K_k$ can be used to almost completely pack every red-blue edge coloring of $K_n$.\n  The following strengthening of the aforementioned Erd\\H{o}s-Hanani result is considered. Suppose $\\C' \\subset \\C(k)$. Is it true that we can use elements only from $\\C'$ and a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09185","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-17T23:55:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Igw0JZtsy3P/uSLLybmTIV93/4ejyQP6AkCDfsVZ5VwovphQpZpz/EsjBGUwTx04XwY3M/lELJcFSRWyRDvRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:09:07.244371Z"},"content_sha256":"d9d0516b231abb9bd21aba9d05e91d7e5dfd33fb1ba907321e90deb317658ccf","schema_version":"1.0","event_id":"sha256:d9d0516b231abb9bd21aba9d05e91d7e5dfd33fb1ba907321e90deb317658ccf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LLPR5WV6EOTU2XIOPGQDRLTOQO/bundle.json","state_url":"https://pith.science/pith/LLPR5WV6EOTU2XIOPGQDRLTOQO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LLPR5WV6EOTU2XIOPGQDRLTOQO/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-30T23:09:07Z","links":{"resolver":"https://pith.science/pith/LLPR5WV6EOTU2XIOPGQDRLTOQO","bundle":"https://pith.science/pith/LLPR5WV6EOTU2XIOPGQDRLTOQO/bundle.json","state":"https://pith.science/pith/LLPR5WV6EOTU2XIOPGQDRLTOQO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LLPR5WV6EOTU2XIOPGQDRLTOQO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LLPR5WV6EOTU2XIOPGQDRLTOQO","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":"b59e4d6975e0044dc56a447a082c27041086550d2ae4da7e1208033e329c78c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-26T09:44:01Z","title_canon_sha256":"dff5a1e6433b3234c53185f031b9167ad97a70ec315d2bf1193ded107c387125"},"schema_version":"1.0","source":{"id":"1901.09185","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09185","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09185v1","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09185","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"pith_short_12","alias_value":"LLPR5WV6EOTU","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LLPR5WV6EOTU2XIO","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LLPR5WV6","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:d9d0516b231abb9bd21aba9d05e91d7e5dfd33fb1ba907321e90deb317658ccf","target":"graph","created_at":"2026-05-17T23:55:26Z","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":"Erd\\H{o}s and Hanani proved that for every fixed integer $k \\ge 2$, the complete graph $K_n$ can be almost completely packed with copies of $K_k$; that is, $K_n$ contains pairwise edge-disjoint copies of $K_k$ that cover all but an $o_n(1)$ fraction of its edges. Equivalently, elements of the set $\\C(k)$ of all red-blue edge colorings of $K_k$ can be used to almost completely pack every red-blue edge coloring of $K_n$.\n  The following strengthening of the aforementioned Erd\\H{o}s-Hanani result is considered. Suppose $\\C' \\subset \\C(k)$. Is it true that we can use elements only from $\\C'$ and a","authors_text":"Raphael Yuster","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-26T09:44:01Z","title":"Packing without some pieces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09185","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:9564e4621dd0fbfa31e69cf1d04d8e06d03daa292b8d9cad7bb618072571e049","target":"record","created_at":"2026-05-17T23:55:26Z","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":"b59e4d6975e0044dc56a447a082c27041086550d2ae4da7e1208033e329c78c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-26T09:44:01Z","title_canon_sha256":"dff5a1e6433b3234c53185f031b9167ad97a70ec315d2bf1193ded107c387125"},"schema_version":"1.0","source":{"id":"1901.09185","kind":"arxiv","version":1}},"canonical_sha256":"5adf1edabe23a74d5d0e79a038ae6e83a6d2bf2931cb33f761f61b9f56ed9a5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5adf1edabe23a74d5d0e79a038ae6e83a6d2bf2931cb33f761f61b9f56ed9a5c","first_computed_at":"2026-05-17T23:55:26.668393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:26.668393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6rHDoNMkqknC5RGh78mrDN8+VDZnP7I9hGvqEw5QpIvJWgiwPGAW0tDI+qS3MQ9JM0WNOH9KZfrDMMzDqgm0Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:26.668772Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09185","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9564e4621dd0fbfa31e69cf1d04d8e06d03daa292b8d9cad7bb618072571e049","sha256:d9d0516b231abb9bd21aba9d05e91d7e5dfd33fb1ba907321e90deb317658ccf"],"state_sha256":"2e1f293931bfde69a2c1c0917677955cf903da31b83fa03291cdfc6d9543e462"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wmWMJtTFaa6z7I/k/E0IzduX+Z4aeIrw3bgbggJBi2Ydoiv956ZvBnxSBqVBdAv2plJtHucRd2B0D2aPWxo0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:09:07.248216Z","bundle_sha256":"eb0631663cae020b0583a2473bf12e70a538202e7f4ad097f153d80b41aadacc"}}