{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XE6LAD4TI5ICMJY22WSLUUZYFQ","short_pith_number":"pith:XE6LAD4T","canonical_record":{"source":{"id":"1204.5355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-24T12:26:22Z","cross_cats_sorted":[],"title_canon_sha256":"54e8680b3d611c3d55dafc6b94771393dfee2d26e631afdd6be292a2924e8b41","abstract_canon_sha256":"085553caf19f95aada23d676c43188d3ad9ec73d0a4ebf1087eac1355abe0765"},"schema_version":"1.0"},"canonical_sha256":"b93cb00f93475026271ad5a4ba53382c31a8a7814a72760d59e8d0ed0c5d838d","source":{"kind":"arxiv","id":"1204.5355","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5355","created_at":"2026-05-18T03:57:13Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5355v1","created_at":"2026-05-18T03:57:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5355","created_at":"2026-05-18T03:57:13Z"},{"alias_kind":"pith_short_12","alias_value":"XE6LAD4TI5IC","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XE6LAD4TI5ICMJY2","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XE6LAD4T","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XE6LAD4TI5ICMJY22WSLUUZYFQ","target":"record","payload":{"canonical_record":{"source":{"id":"1204.5355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-24T12:26:22Z","cross_cats_sorted":[],"title_canon_sha256":"54e8680b3d611c3d55dafc6b94771393dfee2d26e631afdd6be292a2924e8b41","abstract_canon_sha256":"085553caf19f95aada23d676c43188d3ad9ec73d0a4ebf1087eac1355abe0765"},"schema_version":"1.0"},"canonical_sha256":"b93cb00f93475026271ad5a4ba53382c31a8a7814a72760d59e8d0ed0c5d838d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:13.451749Z","signature_b64":"nxgmvkkUmOmsqU8fW9xQw1Wt+e4gmI/ONEmxzCqwKAhLkgEit48K3J8pYcE7uRBRdRfSMva3qfkUBzc5cYh/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b93cb00f93475026271ad5a4ba53382c31a8a7814a72760d59e8d0ed0c5d838d","last_reissued_at":"2026-05-18T03:57:13.451266Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:13.451266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.5355","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:57:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/gwYK+5Uxgi3UYmXWKkQ8PasF8X743qzw7c1Z1BGmccNbhMP2Cc1U9axFDlKe2AofZvV91nGdbntSuGeQu6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:24:38.554857Z"},"content_sha256":"8b581955d2732fed65f5869bf57c50f5ea75cf055797a0daf7c689ae9fc23683","schema_version":"1.0","event_id":"sha256:8b581955d2732fed65f5869bf57c50f5ea75cf055797a0daf7c689ae9fc23683"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XE6LAD4TI5ICMJY22WSLUUZYFQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The method of double chains for largest families with excluded subposets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D\\'aniel T. Nagy, P\\'eter Burcsi","submitted_at":"2012-04-24T12:26:22Z","abstract_excerpt":"For a given finite poset $P$, $La(n,P)$ denotes the largest size of a family $\\mathcal{F}$ of subsets of $[n]$ not containing $P$ as a weak subposet. We exactly determine $La(n,P)$ for infinitely many $P$ posets. These posets are built from seven base posets using two operations. For arbitrary posets, an upper bound is given for $La(n,P)$ depending on $|P|$ and the size of the longest chain in $P$. To prove these theorems we introduce a new method, counting the intersections of $\\mathcal{F}$ with double chains, rather than chains."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5355","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:57:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0/Z68S1vVYQsCl/QUgx7mEZcnbMf3DXJBxoQWw/qRcXUIE49zHYK6fSjAzNE/5eeATRLft+c4k0YRbxKs7FOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:24:38.555192Z"},"content_sha256":"21e6d3a0bbfa03c76e6cef61f91c6326c9d7175127c1110cb0b5c63490414d59","schema_version":"1.0","event_id":"sha256:21e6d3a0bbfa03c76e6cef61f91c6326c9d7175127c1110cb0b5c63490414d59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XE6LAD4TI5ICMJY22WSLUUZYFQ/bundle.json","state_url":"https://pith.science/pith/XE6LAD4TI5ICMJY22WSLUUZYFQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XE6LAD4TI5ICMJY22WSLUUZYFQ/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-09T00:24:38Z","links":{"resolver":"https://pith.science/pith/XE6LAD4TI5ICMJY22WSLUUZYFQ","bundle":"https://pith.science/pith/XE6LAD4TI5ICMJY22WSLUUZYFQ/bundle.json","state":"https://pith.science/pith/XE6LAD4TI5ICMJY22WSLUUZYFQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XE6LAD4TI5ICMJY22WSLUUZYFQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XE6LAD4TI5ICMJY22WSLUUZYFQ","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":"085553caf19f95aada23d676c43188d3ad9ec73d0a4ebf1087eac1355abe0765","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-24T12:26:22Z","title_canon_sha256":"54e8680b3d611c3d55dafc6b94771393dfee2d26e631afdd6be292a2924e8b41"},"schema_version":"1.0","source":{"id":"1204.5355","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5355","created_at":"2026-05-18T03:57:13Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5355v1","created_at":"2026-05-18T03:57:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5355","created_at":"2026-05-18T03:57:13Z"},{"alias_kind":"pith_short_12","alias_value":"XE6LAD4TI5IC","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XE6LAD4TI5ICMJY2","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XE6LAD4T","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:21e6d3a0bbfa03c76e6cef61f91c6326c9d7175127c1110cb0b5c63490414d59","target":"graph","created_at":"2026-05-18T03:57:13Z","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":"For a given finite poset $P$, $La(n,P)$ denotes the largest size of a family $\\mathcal{F}$ of subsets of $[n]$ not containing $P$ as a weak subposet. We exactly determine $La(n,P)$ for infinitely many $P$ posets. These posets are built from seven base posets using two operations. For arbitrary posets, an upper bound is given for $La(n,P)$ depending on $|P|$ and the size of the longest chain in $P$. To prove these theorems we introduce a new method, counting the intersections of $\\mathcal{F}$ with double chains, rather than chains.","authors_text":"D\\'aniel T. Nagy, P\\'eter Burcsi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-24T12:26:22Z","title":"The method of double chains for largest families with excluded subposets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5355","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:8b581955d2732fed65f5869bf57c50f5ea75cf055797a0daf7c689ae9fc23683","target":"record","created_at":"2026-05-18T03:57:13Z","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":"085553caf19f95aada23d676c43188d3ad9ec73d0a4ebf1087eac1355abe0765","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-24T12:26:22Z","title_canon_sha256":"54e8680b3d611c3d55dafc6b94771393dfee2d26e631afdd6be292a2924e8b41"},"schema_version":"1.0","source":{"id":"1204.5355","kind":"arxiv","version":1}},"canonical_sha256":"b93cb00f93475026271ad5a4ba53382c31a8a7814a72760d59e8d0ed0c5d838d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b93cb00f93475026271ad5a4ba53382c31a8a7814a72760d59e8d0ed0c5d838d","first_computed_at":"2026-05-18T03:57:13.451266Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:13.451266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nxgmvkkUmOmsqU8fW9xQw1Wt+e4gmI/ONEmxzCqwKAhLkgEit48K3J8pYcE7uRBRdRfSMva3qfkUBzc5cYh/CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:13.451749Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.5355","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b581955d2732fed65f5869bf57c50f5ea75cf055797a0daf7c689ae9fc23683","sha256:21e6d3a0bbfa03c76e6cef61f91c6326c9d7175127c1110cb0b5c63490414d59"],"state_sha256":"27f6ff02b16cb32a8aadee790d08578c1fa5ed2b02645d5501e62648b4f7d6da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pgVgdE6dTkRfAxIL4QU7K1UTfHBo26Y0tjQG+vLz7CWHko1QjkaJco7+20lhp+vwOYKF4jyo0yY7WtYPAwcoAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:24:38.557140Z","bundle_sha256":"2ae3abe266782a6f1af98876c9ab2f252660ce953635893f41058f178e44920d"}}