{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:H2UJYGJ65VQPUDBNJYHPL4RZYD","short_pith_number":"pith:H2UJYGJ6","schema_version":"1.0","canonical_sha256":"3ea89c193eed60fa0c2d4e0ef5f239c0d2c227b7819dcf0f883f4e2211e9e9bc","source":{"kind":"arxiv","id":"2301.05830","version":1},"attestation_state":"computed","paper":{"title":"Four-vertex traces of finite sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jian Wang, Peter Frankl","submitted_at":"2023-01-14T06:28:13Z","abstract_excerpt":"Let $[n]=X_1\\cup X_2\\cup X_3$ be a partition with $\\lfloor\\frac{n}{3}\\rfloor \\leq |X_i|\\leq \\lceil\\frac{n}{3}\\rceil$ and define $\\mathcal{G}=\\{G\\subset [n]\\colon |G\\cap X_i|\\leq 1, 1\\leq i\\leq 3\\}$. It is easy to check that the trace $\\mathcal{G}_{\\mid Y}:=\\{G\\cap Y\\colon G\\in \\mathcal{G}\\}$ satisfies $|\\mathcal{G}_{\\mid Y}|\\leq 12$ for all 4-sets $Y\\subset [n]$. For $n\\geq 25$ it is proven that whenever $\\mathcal{F}\\subset 2^{[n]}$ satisfies $|\\mathcal{F}|>|\\mathcal{G}|$ then $|\\mathcal{F}_{\\mid C}|\\geq 13$ for some $C\\subset [n]$, $|C|=4$. Several further results of a similar flavor are esta"},"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":"2301.05830","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-01-14T06:28:13Z","cross_cats_sorted":[],"title_canon_sha256":"1859e1b6e72730afdc2e66bc509e6b50745dbb85eb72bbaee357e4d310fa46eb","abstract_canon_sha256":"9f03dbe75966eded55544da517cd58bd041254c83b51ba8687b6553570fd4359"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:33:24.576673Z","signature_b64":"fsSZENpvn5vf0UgPzkGXbqjXG7LICn3w2zLTANb8IrM/H6jC7olXhhdRoVxuKA557Uf4mjez59Oa/tryqsD1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ea89c193eed60fa0c2d4e0ef5f239c0d2c227b7819dcf0f883f4e2211e9e9bc","last_reissued_at":"2026-07-05T05:33:24.576273Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:33:24.576273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Four-vertex traces of finite sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jian Wang, Peter Frankl","submitted_at":"2023-01-14T06:28:13Z","abstract_excerpt":"Let $[n]=X_1\\cup X_2\\cup X_3$ be a partition with $\\lfloor\\frac{n}{3}\\rfloor \\leq |X_i|\\leq \\lceil\\frac{n}{3}\\rceil$ and define $\\mathcal{G}=\\{G\\subset [n]\\colon |G\\cap X_i|\\leq 1, 1\\leq i\\leq 3\\}$. It is easy to check that the trace $\\mathcal{G}_{\\mid Y}:=\\{G\\cap Y\\colon G\\in \\mathcal{G}\\}$ satisfies $|\\mathcal{G}_{\\mid Y}|\\leq 12$ for all 4-sets $Y\\subset [n]$. For $n\\geq 25$ it is proven that whenever $\\mathcal{F}\\subset 2^{[n]}$ satisfies $|\\mathcal{F}|>|\\mathcal{G}|$ then $|\\mathcal{F}_{\\mid C}|\\geq 13$ for some $C\\subset [n]$, $|C|=4$. Several further results of a similar flavor are esta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.05830","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.05830/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2301.05830","created_at":"2026-07-05T05:33:24.576336+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.05830v1","created_at":"2026-07-05T05:33:24.576336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.05830","created_at":"2026-07-05T05:33:24.576336+00:00"},{"alias_kind":"pith_short_12","alias_value":"H2UJYGJ65VQP","created_at":"2026-07-05T05:33:24.576336+00:00"},{"alias_kind":"pith_short_16","alias_value":"H2UJYGJ65VQPUDBN","created_at":"2026-07-05T05:33:24.576336+00:00"},{"alias_kind":"pith_short_8","alias_value":"H2UJYGJ6","created_at":"2026-07-05T05:33:24.576336+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/H2UJYGJ65VQPUDBNJYHPL4RZYD","json":"https://pith.science/pith/H2UJYGJ65VQPUDBNJYHPL4RZYD.json","graph_json":"https://pith.science/api/pith-number/H2UJYGJ65VQPUDBNJYHPL4RZYD/graph.json","events_json":"https://pith.science/api/pith-number/H2UJYGJ65VQPUDBNJYHPL4RZYD/events.json","paper":"https://pith.science/paper/H2UJYGJ6"},"agent_actions":{"view_html":"https://pith.science/pith/H2UJYGJ65VQPUDBNJYHPL4RZYD","download_json":"https://pith.science/pith/H2UJYGJ65VQPUDBNJYHPL4RZYD.json","view_paper":"https://pith.science/paper/H2UJYGJ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.05830&json=true","fetch_graph":"https://pith.science/api/pith-number/H2UJYGJ65VQPUDBNJYHPL4RZYD/graph.json","fetch_events":"https://pith.science/api/pith-number/H2UJYGJ65VQPUDBNJYHPL4RZYD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H2UJYGJ65VQPUDBNJYHPL4RZYD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H2UJYGJ65VQPUDBNJYHPL4RZYD/action/storage_attestation","attest_author":"https://pith.science/pith/H2UJYGJ65VQPUDBNJYHPL4RZYD/action/author_attestation","sign_citation":"https://pith.science/pith/H2UJYGJ65VQPUDBNJYHPL4RZYD/action/citation_signature","submit_replication":"https://pith.science/pith/H2UJYGJ65VQPUDBNJYHPL4RZYD/action/replication_record"}},"created_at":"2026-07-05T05:33:24.576336+00:00","updated_at":"2026-07-05T05:33:24.576336+00:00"}