{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HDFZF4TKHSUKW2JOSBV5MXQO7X","short_pith_number":"pith:HDFZF4TK","canonical_record":{"source":{"id":"1309.6686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-25T22:36:09Z","cross_cats_sorted":[],"title_canon_sha256":"0dbd97fdc6a9a6c2f4361249d2f4e9e02f9292b9a65ff6bc193a226ae11abd3d","abstract_canon_sha256":"657a46b0388c7297aa4e474cb311e3ee7047463afaace6448f8a8ccb27a80f37"},"schema_version":"1.0"},"canonical_sha256":"38cb92f26a3ca8ab692e906bd65e0efdcbde20c5da4c0a24e5b5b9f7174ab557","source":{"kind":"arxiv","id":"1309.6686","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6686","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6686v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6686","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"HDFZF4TKHSUK","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HDFZF4TKHSUKW2JO","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HDFZF4TK","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HDFZF4TKHSUKW2JOSBV5MXQO7X","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-25T22:36:09Z","cross_cats_sorted":[],"title_canon_sha256":"0dbd97fdc6a9a6c2f4361249d2f4e9e02f9292b9a65ff6bc193a226ae11abd3d","abstract_canon_sha256":"657a46b0388c7297aa4e474cb311e3ee7047463afaace6448f8a8ccb27a80f37"},"schema_version":"1.0"},"canonical_sha256":"38cb92f26a3ca8ab692e906bd65e0efdcbde20c5da4c0a24e5b5b9f7174ab557","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:10.874366Z","signature_b64":"PIcvkmRF6sOKcpc0bjOgAINoGm8xOzgr4/frx0oa3p0gN8oZrJVQD7f8F25429qI8T3kTra4ZAdhudqyTL0rDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38cb92f26a3ca8ab692e906bd65e0efdcbde20c5da4c0a24e5b5b9f7174ab557","last_reissued_at":"2026-05-18T03:12:10.873590Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:10.873590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6686","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-18T03:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z/FlCidqfjcXCpLrSB8W8hI2McS2FZ9olRzXxeY9VrUpB0gTfDEJ+cy+LRZLF/BvAeH6tDGgJ1GuMXsko1foCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:27:19.763743Z"},"content_sha256":"99faa281f0962dac9196ce3f56e0b63dca6aae0abb79fc04af49f99fe7876959","schema_version":"1.0","event_id":"sha256:99faa281f0962dac9196ce3f56e0b63dca6aae0abb79fc04af49f99fe7876959"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HDFZF4TKHSUKW2JOSBV5MXQO7X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Packing Posets in the Boolean Lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew P. Dove, Jerrold R. Griggs","submitted_at":"2013-09-25T22:36:09Z","abstract_excerpt":"We are interested in maximizing the number of pairwise unrelated copies of a poset $P$ in the family of all subsets of $[n]$. We prove that for any $P$ the maximum number of unrelated copies of $P$ is asymptotic to a constant times the largest binomial coefficient. Moreover, the constant has the form $\\frac{1}{c(P)}$, where $c(P)$ is the size of the smallest convex closure over all embeddings of $P$ into the Boolean lattice."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6686","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-18T03:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RDJQpFtrvWjyfim7hWIh8dutp6roBKnh8/eLYGYvB6OPB2t47/eMJkiwdtw3N8bPCQikuFPYVRCxWRh8NxDhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:27:19.764090Z"},"content_sha256":"d9d89e95f173f0ce1c52cbcfa3d776ed56402e4bbd5de56ffe6a3df7b12a095e","schema_version":"1.0","event_id":"sha256:d9d89e95f173f0ce1c52cbcfa3d776ed56402e4bbd5de56ffe6a3df7b12a095e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HDFZF4TKHSUKW2JOSBV5MXQO7X/bundle.json","state_url":"https://pith.science/pith/HDFZF4TKHSUKW2JOSBV5MXQO7X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HDFZF4TKHSUKW2JOSBV5MXQO7X/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-04T20:27:19Z","links":{"resolver":"https://pith.science/pith/HDFZF4TKHSUKW2JOSBV5MXQO7X","bundle":"https://pith.science/pith/HDFZF4TKHSUKW2JOSBV5MXQO7X/bundle.json","state":"https://pith.science/pith/HDFZF4TKHSUKW2JOSBV5MXQO7X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HDFZF4TKHSUKW2JOSBV5MXQO7X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HDFZF4TKHSUKW2JOSBV5MXQO7X","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":"657a46b0388c7297aa4e474cb311e3ee7047463afaace6448f8a8ccb27a80f37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-25T22:36:09Z","title_canon_sha256":"0dbd97fdc6a9a6c2f4361249d2f4e9e02f9292b9a65ff6bc193a226ae11abd3d"},"schema_version":"1.0","source":{"id":"1309.6686","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6686","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6686v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6686","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"HDFZF4TKHSUK","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HDFZF4TKHSUKW2JO","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HDFZF4TK","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:d9d89e95f173f0ce1c52cbcfa3d776ed56402e4bbd5de56ffe6a3df7b12a095e","target":"graph","created_at":"2026-05-18T03:12:10Z","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":"We are interested in maximizing the number of pairwise unrelated copies of a poset $P$ in the family of all subsets of $[n]$. We prove that for any $P$ the maximum number of unrelated copies of $P$ is asymptotic to a constant times the largest binomial coefficient. Moreover, the constant has the form $\\frac{1}{c(P)}$, where $c(P)$ is the size of the smallest convex closure over all embeddings of $P$ into the Boolean lattice.","authors_text":"Andrew P. Dove, Jerrold R. Griggs","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-25T22:36:09Z","title":"Packing Posets in the Boolean Lattice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6686","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:99faa281f0962dac9196ce3f56e0b63dca6aae0abb79fc04af49f99fe7876959","target":"record","created_at":"2026-05-18T03:12:10Z","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":"657a46b0388c7297aa4e474cb311e3ee7047463afaace6448f8a8ccb27a80f37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-25T22:36:09Z","title_canon_sha256":"0dbd97fdc6a9a6c2f4361249d2f4e9e02f9292b9a65ff6bc193a226ae11abd3d"},"schema_version":"1.0","source":{"id":"1309.6686","kind":"arxiv","version":1}},"canonical_sha256":"38cb92f26a3ca8ab692e906bd65e0efdcbde20c5da4c0a24e5b5b9f7174ab557","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38cb92f26a3ca8ab692e906bd65e0efdcbde20c5da4c0a24e5b5b9f7174ab557","first_computed_at":"2026-05-18T03:12:10.873590Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:10.873590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PIcvkmRF6sOKcpc0bjOgAINoGm8xOzgr4/frx0oa3p0gN8oZrJVQD7f8F25429qI8T3kTra4ZAdhudqyTL0rDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:10.874366Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6686","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99faa281f0962dac9196ce3f56e0b63dca6aae0abb79fc04af49f99fe7876959","sha256:d9d89e95f173f0ce1c52cbcfa3d776ed56402e4bbd5de56ffe6a3df7b12a095e"],"state_sha256":"8492587ccac36a3cb5bcab175a24fa5a0f4b495f73b2d6fb96c319a1e5036b5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oIAWlLJg3197iMWA/3TK67KodMo3TTTr/mmv/f2jUC4HpQHAueeb5yZObFOECvxEldY4EPLNET5whVBJTmX7DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:27:19.766147Z","bundle_sha256":"3a2fc7ac593788c07fcefa98747b3f7df269097f096a732f0561eed058018056"}}