{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:XE6LAD4TI5ICMJY22WSLUUZYFQ","short_pith_number":"pith:XE6LAD4T","schema_version":"1.0","canonical_sha256":"b93cb00f93475026271ad5a4ba53382c31a8a7814a72760d59e8d0ed0c5d838d","source":{"kind":"arxiv","id":"1204.5355","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1204.5355","created_at":"2026-05-18T03:57:13.451337+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.5355v1","created_at":"2026-05-18T03:57:13.451337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5355","created_at":"2026-05-18T03:57:13.451337+00:00"},{"alias_kind":"pith_short_12","alias_value":"XE6LAD4TI5IC","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"XE6LAD4TI5ICMJY2","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"XE6LAD4T","created_at":"2026-05-18T12:27:27.928770+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XE6LAD4TI5ICMJY22WSLUUZYFQ","json":"https://pith.science/pith/XE6LAD4TI5ICMJY22WSLUUZYFQ.json","graph_json":"https://pith.science/api/pith-number/XE6LAD4TI5ICMJY22WSLUUZYFQ/graph.json","events_json":"https://pith.science/api/pith-number/XE6LAD4TI5ICMJY22WSLUUZYFQ/events.json","paper":"https://pith.science/paper/XE6LAD4T"},"agent_actions":{"view_html":"https://pith.science/pith/XE6LAD4TI5ICMJY22WSLUUZYFQ","download_json":"https://pith.science/pith/XE6LAD4TI5ICMJY22WSLUUZYFQ.json","view_paper":"https://pith.science/paper/XE6LAD4T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.5355&json=true","fetch_graph":"https://pith.science/api/pith-number/XE6LAD4TI5ICMJY22WSLUUZYFQ/graph.json","fetch_events":"https://pith.science/api/pith-number/XE6LAD4TI5ICMJY22WSLUUZYFQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XE6LAD4TI5ICMJY22WSLUUZYFQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XE6LAD4TI5ICMJY22WSLUUZYFQ/action/storage_attestation","attest_author":"https://pith.science/pith/XE6LAD4TI5ICMJY22WSLUUZYFQ/action/author_attestation","sign_citation":"https://pith.science/pith/XE6LAD4TI5ICMJY22WSLUUZYFQ/action/citation_signature","submit_replication":"https://pith.science/pith/XE6LAD4TI5ICMJY22WSLUUZYFQ/action/replication_record"}},"created_at":"2026-05-18T03:57:13.451337+00:00","updated_at":"2026-05-18T03:57:13.451337+00:00"}