{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7LA5FBMRV7NQ7GY6A6RU5TBDN6","short_pith_number":"pith:7LA5FBMR","canonical_record":{"source":{"id":"1601.06332","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-24T01:26:59Z","cross_cats_sorted":[],"title_canon_sha256":"07c6ab36c0a38a20bac9178380ba375cb69a3b5cbbe89a6a90670e8c15bb93c0","abstract_canon_sha256":"4870893adced971b96088c7358d057cea1f8ed7fbe5bd0edb66a18055ab967a5"},"schema_version":"1.0"},"canonical_sha256":"fac1d28591afdb0f9b1e07a34ecc236f8b37efe38510edb5535cad2bb355cc94","source":{"kind":"arxiv","id":"1601.06332","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06332","created_at":"2026-05-18T00:29:47Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06332v2","created_at":"2026-05-18T00:29:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06332","created_at":"2026-05-18T00:29:47Z"},{"alias_kind":"pith_short_12","alias_value":"7LA5FBMRV7NQ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7LA5FBMRV7NQ7GY6","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7LA5FBMR","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7LA5FBMRV7NQ7GY6A6RU5TBDN6","target":"record","payload":{"canonical_record":{"source":{"id":"1601.06332","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-24T01:26:59Z","cross_cats_sorted":[],"title_canon_sha256":"07c6ab36c0a38a20bac9178380ba375cb69a3b5cbbe89a6a90670e8c15bb93c0","abstract_canon_sha256":"4870893adced971b96088c7358d057cea1f8ed7fbe5bd0edb66a18055ab967a5"},"schema_version":"1.0"},"canonical_sha256":"fac1d28591afdb0f9b1e07a34ecc236f8b37efe38510edb5535cad2bb355cc94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:47.121654Z","signature_b64":"iDSSXq/PwDXA0J485BCD4utSUZqyuJUCwyccVeJfst+6tcc4IHOS/SCimn+zlSMqw8g3SSpSLsSUW+ZQlwGBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fac1d28591afdb0f9b1e07a34ecc236f8b37efe38510edb5535cad2bb355cc94","last_reissued_at":"2026-05-18T00:29:47.121015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:47.121015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.06332","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-18T00:29:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nOSB6d7fyCTkSn/dVyVV+jB0FwmVgTHdZPbUW3GIoh3T5yCEoeeB7JKtXyViVMNCATmdBQ9yF+JMkAvSWCvnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:40:42.727488Z"},"content_sha256":"5fb92ff80c14d7fcf36916f97e7976927c348a960d5c3f35888c072a0d35c15c","schema_version":"1.0","event_id":"sha256:5fb92ff80c14d7fcf36916f97e7976927c348a960d5c3f35888c072a0d35c15c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7LA5FBMRV7NQ7GY6A6RU5TBDN6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An upper bound on the size of diamond-free families of sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Casey Tompkins, D\\'aniel Gr\\'osz","submitted_at":"2016-01-24T01:26:59Z","abstract_excerpt":"Let $La(n,P)$ be the maximum size of a family of subsets of $[n]=\\{1,2,...,n\\}$ not containing $P$ as a (weak) subposet. The diamond poset, denoted $B_{2}$, is defined on four elements $x,y,z,w$ with the relations $x<y,z$ and $y,z<w$. $La(n,P)$ has been studied for many posets; one of the major open problems is determining $La(n,B_{2})$.\n  Studying the average number of sets from a family of subsets of $[n]$ on a maximal chain in the Boolean lattice $2^{[n]}$ has been a fruitful method. We use a partitioning of the maximal chains and introduce an induction method to show that $La(n,B_{2})\\leq("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06332","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-18T00:29:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xI70qHv9tj5gE55apsKbCK326ZKSvl+/05AsYQi7aC6CQahCijytXsIWUeJ6tb6UO+nv00T0NZu/WU2jCYxjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:40:42.728132Z"},"content_sha256":"46a99d8df93109ad7becb2da6ac3fafaac6872342f356f503c46cec94eeca99d","schema_version":"1.0","event_id":"sha256:46a99d8df93109ad7becb2da6ac3fafaac6872342f356f503c46cec94eeca99d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7LA5FBMRV7NQ7GY6A6RU5TBDN6/bundle.json","state_url":"https://pith.science/pith/7LA5FBMRV7NQ7GY6A6RU5TBDN6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7LA5FBMRV7NQ7GY6A6RU5TBDN6/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-08T02:40:42Z","links":{"resolver":"https://pith.science/pith/7LA5FBMRV7NQ7GY6A6RU5TBDN6","bundle":"https://pith.science/pith/7LA5FBMRV7NQ7GY6A6RU5TBDN6/bundle.json","state":"https://pith.science/pith/7LA5FBMRV7NQ7GY6A6RU5TBDN6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7LA5FBMRV7NQ7GY6A6RU5TBDN6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7LA5FBMRV7NQ7GY6A6RU5TBDN6","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":"4870893adced971b96088c7358d057cea1f8ed7fbe5bd0edb66a18055ab967a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-24T01:26:59Z","title_canon_sha256":"07c6ab36c0a38a20bac9178380ba375cb69a3b5cbbe89a6a90670e8c15bb93c0"},"schema_version":"1.0","source":{"id":"1601.06332","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06332","created_at":"2026-05-18T00:29:47Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06332v2","created_at":"2026-05-18T00:29:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06332","created_at":"2026-05-18T00:29:47Z"},{"alias_kind":"pith_short_12","alias_value":"7LA5FBMRV7NQ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7LA5FBMRV7NQ7GY6","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7LA5FBMR","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:46a99d8df93109ad7becb2da6ac3fafaac6872342f356f503c46cec94eeca99d","target":"graph","created_at":"2026-05-18T00:29:47Z","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":"Let $La(n,P)$ be the maximum size of a family of subsets of $[n]=\\{1,2,...,n\\}$ not containing $P$ as a (weak) subposet. The diamond poset, denoted $B_{2}$, is defined on four elements $x,y,z,w$ with the relations $x<y,z$ and $y,z<w$. $La(n,P)$ has been studied for many posets; one of the major open problems is determining $La(n,B_{2})$.\n  Studying the average number of sets from a family of subsets of $[n]$ on a maximal chain in the Boolean lattice $2^{[n]}$ has been a fruitful method. We use a partitioning of the maximal chains and introduce an induction method to show that $La(n,B_{2})\\leq(","authors_text":"Abhishek Methuku, Casey Tompkins, D\\'aniel Gr\\'osz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-24T01:26:59Z","title":"An upper bound on the size of diamond-free families of sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06332","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:5fb92ff80c14d7fcf36916f97e7976927c348a960d5c3f35888c072a0d35c15c","target":"record","created_at":"2026-05-18T00:29:47Z","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":"4870893adced971b96088c7358d057cea1f8ed7fbe5bd0edb66a18055ab967a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-24T01:26:59Z","title_canon_sha256":"07c6ab36c0a38a20bac9178380ba375cb69a3b5cbbe89a6a90670e8c15bb93c0"},"schema_version":"1.0","source":{"id":"1601.06332","kind":"arxiv","version":2}},"canonical_sha256":"fac1d28591afdb0f9b1e07a34ecc236f8b37efe38510edb5535cad2bb355cc94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fac1d28591afdb0f9b1e07a34ecc236f8b37efe38510edb5535cad2bb355cc94","first_computed_at":"2026-05-18T00:29:47.121015Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:47.121015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iDSSXq/PwDXA0J485BCD4utSUZqyuJUCwyccVeJfst+6tcc4IHOS/SCimn+zlSMqw8g3SSpSLsSUW+ZQlwGBBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:47.121654Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06332","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5fb92ff80c14d7fcf36916f97e7976927c348a960d5c3f35888c072a0d35c15c","sha256:46a99d8df93109ad7becb2da6ac3fafaac6872342f356f503c46cec94eeca99d"],"state_sha256":"629b90dabe632c89707d0c098c40e3b1277f5ab6ace4c0119264ef186c008e36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9rYUva7XhNRwTDbgK01aCTL+KQWul6bkKdf65lA4Wixn2G5/PwcgdyfKc0b8koJ6VRB9gJr350eKS78M4CCUDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T02:40:42.732341Z","bundle_sha256":"27070651cb3e042d08a67f2318d909c8bdc6bb77dfb354f5039e194b670e456a"}}