{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XXNB2SHDGFA5QKFMPI7IJGNSU5","short_pith_number":"pith:XXNB2SHD","canonical_record":{"source":{"id":"1710.09086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-25T06:49:27Z","cross_cats_sorted":[],"title_canon_sha256":"8266b97c00f9a40bcdbf3b165ff7c609213c3d2db9e5008073f5b5e4f63b0ea7","abstract_canon_sha256":"3354a1aefd3536db7f13e60abbf8777ab98cde6c55ebda1856a8354ca25f7b94"},"schema_version":"1.0"},"canonical_sha256":"bdda1d48e33141d828ac7a3e8499b2a759e5c1e78fe747091fc1dcafbb4f3f63","source":{"kind":"arxiv","id":"1710.09086","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09086","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09086v1","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09086","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"pith_short_12","alias_value":"XXNB2SHDGFA5","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XXNB2SHDGFA5QKFM","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XXNB2SHD","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XXNB2SHDGFA5QKFMPI7IJGNSU5","target":"record","payload":{"canonical_record":{"source":{"id":"1710.09086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-25T06:49:27Z","cross_cats_sorted":[],"title_canon_sha256":"8266b97c00f9a40bcdbf3b165ff7c609213c3d2db9e5008073f5b5e4f63b0ea7","abstract_canon_sha256":"3354a1aefd3536db7f13e60abbf8777ab98cde6c55ebda1856a8354ca25f7b94"},"schema_version":"1.0"},"canonical_sha256":"bdda1d48e33141d828ac7a3e8499b2a759e5c1e78fe747091fc1dcafbb4f3f63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:00.402377Z","signature_b64":"htmDHyG/T0Gs1aKrNaB1zPjt+rjubShOUhCclyHNpzsQbqwtpLxq/jQhZcWcoyQcwgZBRyElwGAvxAtgkRvXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdda1d48e33141d828ac7a3e8499b2a759e5c1e78fe747091fc1dcafbb4f3f63","last_reissued_at":"2026-05-18T00:32:00.401777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:00.401777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.09086","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-18T00:32:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"61Zql4um6fM2chCVF9zeSB4Ho2q0LjBBqfUjVcqzvKzV2VHi6x6JxeWFuZs3NMAw4VNcIosyZAiVXJFC07KLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:40:20.068957Z"},"content_sha256":"f6bb959cdd166ca61194630f21bb3bcfb1ee1e4fcafb687c64fa887b0567c062","schema_version":"1.0","event_id":"sha256:f6bb959cdd166ca61194630f21bb3bcfb1ee1e4fcafb687c64fa887b0567c062"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XXNB2SHDGFA5QKFMPI7IJGNSU5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Forbidding rank-preserving copies of a poset","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Bal\\'azs Patk\\'os, D\\'aniel Gerbner, D\\'aniel T. Nagy, M\\'at\\'e Vizer","submitted_at":"2017-10-25T06:49:27Z","abstract_excerpt":"The maximum size, $La(n,P)$, of a family of subsets of $[n]=\\{1,2,...,n\\}$ without containing a copy of $P$ as a subposet, has been intensively studied.\n  Let $P$ be a graded poset. We say that a family $\\mathcal{F}$ of subsets of $[n]=\\{1,2,...,n\\}$ contains a \\emph{rank-preserving} copy of $P$ if it contains a copy of $P$ such that elements of $P$ having the same rank are mapped to sets of same size in $\\mathcal{F}$. The largest size of a family of subsets of $[n]=\\{1,2,...,n\\}$ without containing a rank-preserving copy of $P$ as a subposet is denoted by $La_{rp}(n,P)$. Clearly, $La(n,P) \\le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09086","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-18T00:32:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+h4qqfXp21oU0XXTtrdxK4SC0ep65Yht6w7oGQdrqEuDWNtnTRdsMOlZVQD9LyVhkhj6Ms5DBP9GLPuwnZo4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:40:20.069297Z"},"content_sha256":"131fc7e28be623799f26d0781017f564d9ed696f82be4bdbbfa70ae0215e624b","schema_version":"1.0","event_id":"sha256:131fc7e28be623799f26d0781017f564d9ed696f82be4bdbbfa70ae0215e624b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XXNB2SHDGFA5QKFMPI7IJGNSU5/bundle.json","state_url":"https://pith.science/pith/XXNB2SHDGFA5QKFMPI7IJGNSU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XXNB2SHDGFA5QKFMPI7IJGNSU5/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-01T19:40:20Z","links":{"resolver":"https://pith.science/pith/XXNB2SHDGFA5QKFMPI7IJGNSU5","bundle":"https://pith.science/pith/XXNB2SHDGFA5QKFMPI7IJGNSU5/bundle.json","state":"https://pith.science/pith/XXNB2SHDGFA5QKFMPI7IJGNSU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XXNB2SHDGFA5QKFMPI7IJGNSU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XXNB2SHDGFA5QKFMPI7IJGNSU5","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":"3354a1aefd3536db7f13e60abbf8777ab98cde6c55ebda1856a8354ca25f7b94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-25T06:49:27Z","title_canon_sha256":"8266b97c00f9a40bcdbf3b165ff7c609213c3d2db9e5008073f5b5e4f63b0ea7"},"schema_version":"1.0","source":{"id":"1710.09086","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09086","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09086v1","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09086","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"pith_short_12","alias_value":"XXNB2SHDGFA5","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XXNB2SHDGFA5QKFM","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XXNB2SHD","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:131fc7e28be623799f26d0781017f564d9ed696f82be4bdbbfa70ae0215e624b","target":"graph","created_at":"2026-05-18T00:32:00Z","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":"The maximum size, $La(n,P)$, of a family of subsets of $[n]=\\{1,2,...,n\\}$ without containing a copy of $P$ as a subposet, has been intensively studied.\n  Let $P$ be a graded poset. We say that a family $\\mathcal{F}$ of subsets of $[n]=\\{1,2,...,n\\}$ contains a \\emph{rank-preserving} copy of $P$ if it contains a copy of $P$ such that elements of $P$ having the same rank are mapped to sets of same size in $\\mathcal{F}$. The largest size of a family of subsets of $[n]=\\{1,2,...,n\\}$ without containing a rank-preserving copy of $P$ as a subposet is denoted by $La_{rp}(n,P)$. Clearly, $La(n,P) \\le","authors_text":"Abhishek Methuku, Bal\\'azs Patk\\'os, D\\'aniel Gerbner, D\\'aniel T. Nagy, M\\'at\\'e Vizer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-25T06:49:27Z","title":"Forbidding rank-preserving copies of a poset"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09086","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:f6bb959cdd166ca61194630f21bb3bcfb1ee1e4fcafb687c64fa887b0567c062","target":"record","created_at":"2026-05-18T00:32:00Z","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":"3354a1aefd3536db7f13e60abbf8777ab98cde6c55ebda1856a8354ca25f7b94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-25T06:49:27Z","title_canon_sha256":"8266b97c00f9a40bcdbf3b165ff7c609213c3d2db9e5008073f5b5e4f63b0ea7"},"schema_version":"1.0","source":{"id":"1710.09086","kind":"arxiv","version":1}},"canonical_sha256":"bdda1d48e33141d828ac7a3e8499b2a759e5c1e78fe747091fc1dcafbb4f3f63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdda1d48e33141d828ac7a3e8499b2a759e5c1e78fe747091fc1dcafbb4f3f63","first_computed_at":"2026-05-18T00:32:00.401777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:00.401777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"htmDHyG/T0Gs1aKrNaB1zPjt+rjubShOUhCclyHNpzsQbqwtpLxq/jQhZcWcoyQcwgZBRyElwGAvxAtgkRvXDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:00.402377Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.09086","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6bb959cdd166ca61194630f21bb3bcfb1ee1e4fcafb687c64fa887b0567c062","sha256:131fc7e28be623799f26d0781017f564d9ed696f82be4bdbbfa70ae0215e624b"],"state_sha256":"a072996233ba0da655b496e3dad6cb294022502221f54eccf49a61a833ab1321"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xh7Au05iiy2E0tbAzwWpIpuLglYagNn++S3bNjwIH00S23LoWkP78HIwGpyBBFmPgOecyNPV+m63YFOHNip3Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:40:20.071187Z","bundle_sha256":"d17bc9e59413edc33efa66f736229f540cde038fe2037062e171352aaa2a9c07"}}