{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4NFBE7HW6AIS2MWYB54N3LQZVC","short_pith_number":"pith:4NFBE7HW","canonical_record":{"source":{"id":"1706.01212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-05T06:46:40Z","cross_cats_sorted":[],"title_canon_sha256":"341323cff344233f357bfa90e2ff208e8f0e178788455ccd2b0c04731e69610b","abstract_canon_sha256":"62d4adf20f33d7a31b3cdacc7806d2d7b28681e78a486df32018678f8360ebaa"},"schema_version":"1.0"},"canonical_sha256":"e34a127cf6f0112d32d80f78ddae19a8b74ebe1e92fdd253f1d49df176dac853","source":{"kind":"arxiv","id":"1706.01212","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01212","created_at":"2026-05-18T00:43:04Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01212v1","created_at":"2026-05-18T00:43:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01212","created_at":"2026-05-18T00:43:04Z"},{"alias_kind":"pith_short_12","alias_value":"4NFBE7HW6AIS","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4NFBE7HW6AIS2MWY","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4NFBE7HW","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4NFBE7HW6AIS2MWYB54N3LQZVC","target":"record","payload":{"canonical_record":{"source":{"id":"1706.01212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-05T06:46:40Z","cross_cats_sorted":[],"title_canon_sha256":"341323cff344233f357bfa90e2ff208e8f0e178788455ccd2b0c04731e69610b","abstract_canon_sha256":"62d4adf20f33d7a31b3cdacc7806d2d7b28681e78a486df32018678f8360ebaa"},"schema_version":"1.0"},"canonical_sha256":"e34a127cf6f0112d32d80f78ddae19a8b74ebe1e92fdd253f1d49df176dac853","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:04.186750Z","signature_b64":"lCwVGSNgjR+8voeRUdfG6MSr35bFwE7KRwuPEsBXgP+davLqvpSP2G13bL4y6S7mJhPVtscjtptFGXpPtiq2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e34a127cf6f0112d32d80f78ddae19a8b74ebe1e92fdd253f1d49df176dac853","last_reissued_at":"2026-05-18T00:43:04.186194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:04.186194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.01212","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:43:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I0YspFz4Q5LlCpOD17WSYfPbqA4Cbtv54vaNY1o+bBzBrvbiC0lO7UxAzoExKbnn/NzfhADzo4S7MdUdYF0KBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:42:38.477268Z"},"content_sha256":"86f7e076c171652b7ed4f3a07874610313b075ca2421e4f25898b25bdfde4476","schema_version":"1.0","event_id":"sha256:86f7e076c171652b7ed4f3a07874610313b075ca2421e4f25898b25bdfde4476"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4NFBE7HW6AIS2MWYB54N3LQZVC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Forbidden subposet problems for traces of set families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Patk\\'os, D\\'aniel Gerbner, M\\'at\\'e Vizer","submitted_at":"2017-06-05T06:46:40Z","abstract_excerpt":"In this paper we introduce a problem that bridges forbidden subposet and forbidden subconfiguration problems. The sets $F_1,F_2, \\dots,F_{|P|}$ form a copy of a poset $P$, if there exists a bijection $i:P\\rightarrow \\{F_1,F_2, \\dots,F_{|P|}\\}$ such that for any $p,p'\\in P$ the relation $p<_P p'$ implies $i(p)\\subsetneq i(p')$. A family $\\mathcal{F}$ of sets is \\textit{$P$-free} if it does not contain any copy of $P$. The trace of a family $\\mathcal{F}$ on a set $X$ is $\\mathcal{F}|_X:=\\{F\\cap X: F\\in \\mathcal{F}\\}$.\n  We introduce the following notions: $\\mathcal{F}\\subseteq 2^{[n]}$ is $l$-tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01212","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:43:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8isFiIRKos/O+N1EF2vVryUmjFr0gRB9ohUmh2D5XpsgVXdPP1rWRNqUR54/cDGkpQ61aDJaiY9UkDuNTecLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:42:38.477893Z"},"content_sha256":"fbd9e3e615c9077e687d11ef539568177e33e8397bc46797b46648be2a146812","schema_version":"1.0","event_id":"sha256:fbd9e3e615c9077e687d11ef539568177e33e8397bc46797b46648be2a146812"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4NFBE7HW6AIS2MWYB54N3LQZVC/bundle.json","state_url":"https://pith.science/pith/4NFBE7HW6AIS2MWYB54N3LQZVC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4NFBE7HW6AIS2MWYB54N3LQZVC/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-05-30T07:42:38Z","links":{"resolver":"https://pith.science/pith/4NFBE7HW6AIS2MWYB54N3LQZVC","bundle":"https://pith.science/pith/4NFBE7HW6AIS2MWYB54N3LQZVC/bundle.json","state":"https://pith.science/pith/4NFBE7HW6AIS2MWYB54N3LQZVC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4NFBE7HW6AIS2MWYB54N3LQZVC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4NFBE7HW6AIS2MWYB54N3LQZVC","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":"62d4adf20f33d7a31b3cdacc7806d2d7b28681e78a486df32018678f8360ebaa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-05T06:46:40Z","title_canon_sha256":"341323cff344233f357bfa90e2ff208e8f0e178788455ccd2b0c04731e69610b"},"schema_version":"1.0","source":{"id":"1706.01212","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01212","created_at":"2026-05-18T00:43:04Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01212v1","created_at":"2026-05-18T00:43:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01212","created_at":"2026-05-18T00:43:04Z"},{"alias_kind":"pith_short_12","alias_value":"4NFBE7HW6AIS","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4NFBE7HW6AIS2MWY","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4NFBE7HW","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:fbd9e3e615c9077e687d11ef539568177e33e8397bc46797b46648be2a146812","target":"graph","created_at":"2026-05-18T00:43:04Z","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":"In this paper we introduce a problem that bridges forbidden subposet and forbidden subconfiguration problems. The sets $F_1,F_2, \\dots,F_{|P|}$ form a copy of a poset $P$, if there exists a bijection $i:P\\rightarrow \\{F_1,F_2, \\dots,F_{|P|}\\}$ such that for any $p,p'\\in P$ the relation $p<_P p'$ implies $i(p)\\subsetneq i(p')$. A family $\\mathcal{F}$ of sets is \\textit{$P$-free} if it does not contain any copy of $P$. The trace of a family $\\mathcal{F}$ on a set $X$ is $\\mathcal{F}|_X:=\\{F\\cap X: F\\in \\mathcal{F}\\}$.\n  We introduce the following notions: $\\mathcal{F}\\subseteq 2^{[n]}$ is $l$-tr","authors_text":"Bal\\'azs Patk\\'os, D\\'aniel Gerbner, M\\'at\\'e Vizer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-05T06:46:40Z","title":"Forbidden subposet problems for traces of set families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01212","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:86f7e076c171652b7ed4f3a07874610313b075ca2421e4f25898b25bdfde4476","target":"record","created_at":"2026-05-18T00:43:04Z","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":"62d4adf20f33d7a31b3cdacc7806d2d7b28681e78a486df32018678f8360ebaa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-05T06:46:40Z","title_canon_sha256":"341323cff344233f357bfa90e2ff208e8f0e178788455ccd2b0c04731e69610b"},"schema_version":"1.0","source":{"id":"1706.01212","kind":"arxiv","version":1}},"canonical_sha256":"e34a127cf6f0112d32d80f78ddae19a8b74ebe1e92fdd253f1d49df176dac853","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e34a127cf6f0112d32d80f78ddae19a8b74ebe1e92fdd253f1d49df176dac853","first_computed_at":"2026-05-18T00:43:04.186194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:04.186194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lCwVGSNgjR+8voeRUdfG6MSr35bFwE7KRwuPEsBXgP+davLqvpSP2G13bL4y6S7mJhPVtscjtptFGXpPtiq2Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:04.186750Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.01212","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86f7e076c171652b7ed4f3a07874610313b075ca2421e4f25898b25bdfde4476","sha256:fbd9e3e615c9077e687d11ef539568177e33e8397bc46797b46648be2a146812"],"state_sha256":"a0de02cc91c4fb7bccc1c94683218acad55772d9018a245cc02d12a58fe360de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p1wDLr1XFdK9hSYhWBQtrmnj6fSGRqRVc9TekfLLHHQa+zYnNEqX4nRFJ9q1y4gI3TLYqyS4tnt068PhaCh/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:42:38.481290Z","bundle_sha256":"03c6597164052b9663028dc0dd658b66d7f2ef6cf7874b394275b415a1eb083f"}}