{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5CLU5EA677DV2YJCSPQNE6KV42","short_pith_number":"pith:5CLU5EA6","canonical_record":{"source":{"id":"1309.5638","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-22T19:19:37Z","cross_cats_sorted":[],"title_canon_sha256":"b6bc3691693b44c153252aef6c0e9fe7093af631bd18f771a3919e92f2925df7","abstract_canon_sha256":"fa036f78ceceaee56a7d5299f6dc30d372d6d8db784ec39ae9b56fe4cc0e9244"},"schema_version":"1.0"},"canonical_sha256":"e8974e901effc75d612293e0d27955e6862b5fa93906a42dcecc723fed153a73","source":{"kind":"arxiv","id":"1309.5638","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5638","created_at":"2026-05-18T02:29:23Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5638v2","created_at":"2026-05-18T02:29:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5638","created_at":"2026-05-18T02:29:23Z"},{"alias_kind":"pith_short_12","alias_value":"5CLU5EA677DV","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5CLU5EA677DV2YJC","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5CLU5EA6","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5CLU5EA677DV2YJCSPQNE6KV42","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5638","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-22T19:19:37Z","cross_cats_sorted":[],"title_canon_sha256":"b6bc3691693b44c153252aef6c0e9fe7093af631bd18f771a3919e92f2925df7","abstract_canon_sha256":"fa036f78ceceaee56a7d5299f6dc30d372d6d8db784ec39ae9b56fe4cc0e9244"},"schema_version":"1.0"},"canonical_sha256":"e8974e901effc75d612293e0d27955e6862b5fa93906a42dcecc723fed153a73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:23.609171Z","signature_b64":"ladHkfPyG0lZxwH/+yWxgUy95WSoOogCVbIlFWGJUwtQBM2tUMkynalKAvPKulhpAngMCFSReIC331Vph10wCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8974e901effc75d612293e0d27955e6862b5fa93906a42dcecc723fed153a73","last_reissued_at":"2026-05-18T02:29:23.608673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:23.608673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5638","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-18T02:29:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LrPMx6CmU1k8Z2xQ7bWd60v9qdLeENbwhmbUYeX+iEfyHMvP2j6y0HFq18J2qerEENQ3mUIOy65OR8Kw16UeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:31:34.515188Z"},"content_sha256":"70412e05a962d28501cb123c5c3489afaa9dd5289538af122863d0734ecda89c","schema_version":"1.0","event_id":"sha256:70412e05a962d28501cb123c5c3489afaa9dd5289538af122863d0734ecda89c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5CLU5EA677DV2YJCSPQNE6KV42","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Abelian groups yield many large families for the diamond problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aaron Dutle, \\'Eva Czabarka, L\\'aszl\\'o A. Sz\\'ekely, Travis Johnston","submitted_at":"2013-09-22T19:19:37Z","abstract_excerpt":"There is much recent interest in excluded subposets. Given a fixed poset $P$, how many subsets of $[n]$ can found without a copy of $P$ realized by the subset relation? The hardest and most intensely investigated problem of this kind is when $P$ is a diamond, i.e. the power set of a 2 element set. In this paper, we show infinitely many asymptotically tight constructions using random set families defined from posets based on Abelian groups. They are provided by the convergence of Markov chains on groups. Such constructions suggest that the diamond problem is hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5638","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-18T02:29:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HuyNJZqJjoAqGH9THyYtMc6+YgqbMyKMf3vl1Ag8GmU4GDU3br32wYQYL8Tn014AhQVwrg+QoUKMkiDqgW8IBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:31:34.515548Z"},"content_sha256":"75fca1b0907053d3a477bf15b9fe5fba7d1cced2598e6fc2b731993d94ccaa6d","schema_version":"1.0","event_id":"sha256:75fca1b0907053d3a477bf15b9fe5fba7d1cced2598e6fc2b731993d94ccaa6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5CLU5EA677DV2YJCSPQNE6KV42/bundle.json","state_url":"https://pith.science/pith/5CLU5EA677DV2YJCSPQNE6KV42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5CLU5EA677DV2YJCSPQNE6KV42/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-01T12:31:34Z","links":{"resolver":"https://pith.science/pith/5CLU5EA677DV2YJCSPQNE6KV42","bundle":"https://pith.science/pith/5CLU5EA677DV2YJCSPQNE6KV42/bundle.json","state":"https://pith.science/pith/5CLU5EA677DV2YJCSPQNE6KV42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5CLU5EA677DV2YJCSPQNE6KV42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5CLU5EA677DV2YJCSPQNE6KV42","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":"fa036f78ceceaee56a7d5299f6dc30d372d6d8db784ec39ae9b56fe4cc0e9244","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-22T19:19:37Z","title_canon_sha256":"b6bc3691693b44c153252aef6c0e9fe7093af631bd18f771a3919e92f2925df7"},"schema_version":"1.0","source":{"id":"1309.5638","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5638","created_at":"2026-05-18T02:29:23Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5638v2","created_at":"2026-05-18T02:29:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5638","created_at":"2026-05-18T02:29:23Z"},{"alias_kind":"pith_short_12","alias_value":"5CLU5EA677DV","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5CLU5EA677DV2YJC","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5CLU5EA6","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:75fca1b0907053d3a477bf15b9fe5fba7d1cced2598e6fc2b731993d94ccaa6d","target":"graph","created_at":"2026-05-18T02:29:23Z","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":"There is much recent interest in excluded subposets. Given a fixed poset $P$, how many subsets of $[n]$ can found without a copy of $P$ realized by the subset relation? The hardest and most intensely investigated problem of this kind is when $P$ is a diamond, i.e. the power set of a 2 element set. In this paper, we show infinitely many asymptotically tight constructions using random set families defined from posets based on Abelian groups. They are provided by the convergence of Markov chains on groups. Such constructions suggest that the diamond problem is hard.","authors_text":"Aaron Dutle, \\'Eva Czabarka, L\\'aszl\\'o A. Sz\\'ekely, Travis Johnston","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-22T19:19:37Z","title":"Abelian groups yield many large families for the diamond problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5638","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:70412e05a962d28501cb123c5c3489afaa9dd5289538af122863d0734ecda89c","target":"record","created_at":"2026-05-18T02:29:23Z","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":"fa036f78ceceaee56a7d5299f6dc30d372d6d8db784ec39ae9b56fe4cc0e9244","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-22T19:19:37Z","title_canon_sha256":"b6bc3691693b44c153252aef6c0e9fe7093af631bd18f771a3919e92f2925df7"},"schema_version":"1.0","source":{"id":"1309.5638","kind":"arxiv","version":2}},"canonical_sha256":"e8974e901effc75d612293e0d27955e6862b5fa93906a42dcecc723fed153a73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8974e901effc75d612293e0d27955e6862b5fa93906a42dcecc723fed153a73","first_computed_at":"2026-05-18T02:29:23.608673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:23.608673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ladHkfPyG0lZxwH/+yWxgUy95WSoOogCVbIlFWGJUwtQBM2tUMkynalKAvPKulhpAngMCFSReIC331Vph10wCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:23.609171Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5638","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70412e05a962d28501cb123c5c3489afaa9dd5289538af122863d0734ecda89c","sha256:75fca1b0907053d3a477bf15b9fe5fba7d1cced2598e6fc2b731993d94ccaa6d"],"state_sha256":"98c709af185102033ca972279adb465ba8158ff3c971ff7a7757741980241ab0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1xEfJGvC2KIagM42FnIWHUvWfLaroxLQwgUo/Qte0uqJc8zG6LwI6tegxJZzWGWPZEQQGy8ewBkxMwhlfHM9Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:31:34.517546Z","bundle_sha256":"0886abdcde3f279b93daff5766b3515f96c3f3b43ce7b906737358f077ae89a8"}}