{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LPRN5KDAKAB5H7TJMX36UWESAM","short_pith_number":"pith:LPRN5KDA","canonical_record":{"source":{"id":"1802.05051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-14T11:51:25Z","cross_cats_sorted":[],"title_canon_sha256":"b292d6423b66d5df30a175e1fb7630d4bacd59e2839cddb58d8bef468e92f17b","abstract_canon_sha256":"a129af98fa0b5452888d4d810dec0a2b6d6728ae15208b104c9cc37159b6b590"},"schema_version":"1.0"},"canonical_sha256":"5be2dea8605003d3fe6965f7ea58920318d4c76b8c945dd20b9ec4b42796277c","source":{"kind":"arxiv","id":"1802.05051","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05051","created_at":"2026-05-18T00:23:21Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05051v1","created_at":"2026-05-18T00:23:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05051","created_at":"2026-05-18T00:23:21Z"},{"alias_kind":"pith_short_12","alias_value":"LPRN5KDAKAB5","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LPRN5KDAKAB5H7TJ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LPRN5KDA","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LPRN5KDAKAB5H7TJMX36UWESAM","target":"record","payload":{"canonical_record":{"source":{"id":"1802.05051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-14T11:51:25Z","cross_cats_sorted":[],"title_canon_sha256":"b292d6423b66d5df30a175e1fb7630d4bacd59e2839cddb58d8bef468e92f17b","abstract_canon_sha256":"a129af98fa0b5452888d4d810dec0a2b6d6728ae15208b104c9cc37159b6b590"},"schema_version":"1.0"},"canonical_sha256":"5be2dea8605003d3fe6965f7ea58920318d4c76b8c945dd20b9ec4b42796277c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:21.808254Z","signature_b64":"ZrJHDtCSiZBhcDxs+7/VqeOL6I7rMY1LUeh+qjYo/NLn+Kd+uHwipN0AeLB1PZOhLBtn/uhMh2pBUP0FBYhkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5be2dea8605003d3fe6965f7ea58920318d4c76b8c945dd20b9ec4b42796277c","last_reissued_at":"2026-05-18T00:23:21.807601Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:21.807601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.05051","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-18T00:23:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rnwAbz527wmyPNnWZo7RhfOfjTE5xD4tAH+LEOpscInaz+yOWI0SIEbiF5A2BkBb2Dol6X5hISEkQCMkfow0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:24:38.643734Z"},"content_sha256":"11d176b4fe8ee67dfe3ba9209a03f4c95b95ff6b1bed4badd94abeb666ff2c7d","schema_version":"1.0","event_id":"sha256:11d176b4fe8ee67dfe3ba9209a03f4c95b95ff6b1bed4badd94abeb666ff2c7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LPRN5KDAKAB5H7TJMX36UWESAM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on packing of uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej \\.Zak, Jerzy Konarski, Mariusz Wo\\'zniak","submitted_at":"2018-02-14T11:51:25Z","abstract_excerpt":"A packing of two $k$-uniform hypergraphs $H_1$ and $H_2$ is a set $\\{H_1', H_2'\\}$ of edge-disjoint sub-hypergraphs of the complete $k$-uniform hypergraph $K_n^{(k)}$ such that $H_1'\\cong H_1$ and $H_2'\\cong H_2$. Whilst the problem of packing of graphs (i.e. 2-uniform hypergraphs) has been studied extensively since seventies with many sharp results, much less is known about packing of general hypergraphs. In this paper we attempt to find the minimum possible sum of sizes $m(n,k)$ of two $k$-uniform, $n$-vertex hypergaphs which do not pack. We also prove a sufficient condition on the product o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05051","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-18T00:23:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W9fk4plBURk24fre/V9BEcAw7EBLtlp8AXnawcn/HtjsGiO8Abt8/XfHz1ms1pqvpU+qHLzsYUxv3M21C3+BAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:24:38.644071Z"},"content_sha256":"0bbd768a1ecc805aa7056283a2ab52647c3d47220cd4990a0f0f178e5f8d7f00","schema_version":"1.0","event_id":"sha256:0bbd768a1ecc805aa7056283a2ab52647c3d47220cd4990a0f0f178e5f8d7f00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LPRN5KDAKAB5H7TJMX36UWESAM/bundle.json","state_url":"https://pith.science/pith/LPRN5KDAKAB5H7TJMX36UWESAM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LPRN5KDAKAB5H7TJMX36UWESAM/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-26T00:24:38Z","links":{"resolver":"https://pith.science/pith/LPRN5KDAKAB5H7TJMX36UWESAM","bundle":"https://pith.science/pith/LPRN5KDAKAB5H7TJMX36UWESAM/bundle.json","state":"https://pith.science/pith/LPRN5KDAKAB5H7TJMX36UWESAM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LPRN5KDAKAB5H7TJMX36UWESAM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LPRN5KDAKAB5H7TJMX36UWESAM","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":"a129af98fa0b5452888d4d810dec0a2b6d6728ae15208b104c9cc37159b6b590","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-14T11:51:25Z","title_canon_sha256":"b292d6423b66d5df30a175e1fb7630d4bacd59e2839cddb58d8bef468e92f17b"},"schema_version":"1.0","source":{"id":"1802.05051","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05051","created_at":"2026-05-18T00:23:21Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05051v1","created_at":"2026-05-18T00:23:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05051","created_at":"2026-05-18T00:23:21Z"},{"alias_kind":"pith_short_12","alias_value":"LPRN5KDAKAB5","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LPRN5KDAKAB5H7TJ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LPRN5KDA","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:0bbd768a1ecc805aa7056283a2ab52647c3d47220cd4990a0f0f178e5f8d7f00","target":"graph","created_at":"2026-05-18T00:23:21Z","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":"A packing of two $k$-uniform hypergraphs $H_1$ and $H_2$ is a set $\\{H_1', H_2'\\}$ of edge-disjoint sub-hypergraphs of the complete $k$-uniform hypergraph $K_n^{(k)}$ such that $H_1'\\cong H_1$ and $H_2'\\cong H_2$. Whilst the problem of packing of graphs (i.e. 2-uniform hypergraphs) has been studied extensively since seventies with many sharp results, much less is known about packing of general hypergraphs. In this paper we attempt to find the minimum possible sum of sizes $m(n,k)$ of two $k$-uniform, $n$-vertex hypergaphs which do not pack. We also prove a sufficient condition on the product o","authors_text":"Andrzej \\.Zak, Jerzy Konarski, Mariusz Wo\\'zniak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-14T11:51:25Z","title":"A note on packing of uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05051","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:11d176b4fe8ee67dfe3ba9209a03f4c95b95ff6b1bed4badd94abeb666ff2c7d","target":"record","created_at":"2026-05-18T00:23:21Z","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":"a129af98fa0b5452888d4d810dec0a2b6d6728ae15208b104c9cc37159b6b590","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-14T11:51:25Z","title_canon_sha256":"b292d6423b66d5df30a175e1fb7630d4bacd59e2839cddb58d8bef468e92f17b"},"schema_version":"1.0","source":{"id":"1802.05051","kind":"arxiv","version":1}},"canonical_sha256":"5be2dea8605003d3fe6965f7ea58920318d4c76b8c945dd20b9ec4b42796277c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5be2dea8605003d3fe6965f7ea58920318d4c76b8c945dd20b9ec4b42796277c","first_computed_at":"2026-05-18T00:23:21.807601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:21.807601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZrJHDtCSiZBhcDxs+7/VqeOL6I7rMY1LUeh+qjYo/NLn+Kd+uHwipN0AeLB1PZOhLBtn/uhMh2pBUP0FBYhkBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:21.808254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05051","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11d176b4fe8ee67dfe3ba9209a03f4c95b95ff6b1bed4badd94abeb666ff2c7d","sha256:0bbd768a1ecc805aa7056283a2ab52647c3d47220cd4990a0f0f178e5f8d7f00"],"state_sha256":"ee032687d62aae5e106d0d8bf4742791bd9b29b12ff1a7861b6703dccaddf032"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"49Lv7tw1f3BnC46c/Y1A05HFI+v1HOS3wOZsBw3K4ItL5UY/Ib45eHdg+WudlwQmn9fXDtpXDmaLAzDkoSNhBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T00:24:38.646049Z","bundle_sha256":"59976b94186e07007bfe46e81d68edcd4fffe7dae10c5065e647f17b05931bd7"}}