{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LLPR5WV6EOTU2XIOPGQDRLTOQO","short_pith_number":"pith:LLPR5WV6","schema_version":"1.0","canonical_sha256":"5adf1edabe23a74d5d0e79a038ae6e83a6d2bf2931cb33f761f61b9f56ed9a5c","source":{"kind":"arxiv","id":"1901.09185","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.09185","created_at":"2026-05-17T23:55:26.668459+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.09185v1","created_at":"2026-05-17T23:55:26.668459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09185","created_at":"2026-05-17T23:55:26.668459+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLPR5WV6EOTU","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLPR5WV6EOTU2XIO","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLPR5WV6","created_at":"2026-05-18T12:33:21.387695+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/LLPR5WV6EOTU2XIOPGQDRLTOQO","json":"https://pith.science/pith/LLPR5WV6EOTU2XIOPGQDRLTOQO.json","graph_json":"https://pith.science/api/pith-number/LLPR5WV6EOTU2XIOPGQDRLTOQO/graph.json","events_json":"https://pith.science/api/pith-number/LLPR5WV6EOTU2XIOPGQDRLTOQO/events.json","paper":"https://pith.science/paper/LLPR5WV6"},"agent_actions":{"view_html":"https://pith.science/pith/LLPR5WV6EOTU2XIOPGQDRLTOQO","download_json":"https://pith.science/pith/LLPR5WV6EOTU2XIOPGQDRLTOQO.json","view_paper":"https://pith.science/paper/LLPR5WV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.09185&json=true","fetch_graph":"https://pith.science/api/pith-number/LLPR5WV6EOTU2XIOPGQDRLTOQO/graph.json","fetch_events":"https://pith.science/api/pith-number/LLPR5WV6EOTU2XIOPGQDRLTOQO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLPR5WV6EOTU2XIOPGQDRLTOQO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLPR5WV6EOTU2XIOPGQDRLTOQO/action/storage_attestation","attest_author":"https://pith.science/pith/LLPR5WV6EOTU2XIOPGQDRLTOQO/action/author_attestation","sign_citation":"https://pith.science/pith/LLPR5WV6EOTU2XIOPGQDRLTOQO/action/citation_signature","submit_replication":"https://pith.science/pith/LLPR5WV6EOTU2XIOPGQDRLTOQO/action/replication_record"}},"created_at":"2026-05-17T23:55:26.668459+00:00","updated_at":"2026-05-17T23:55:26.668459+00:00"}