{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MGG5JJ6VNXM2HHVHSXWZVGKBWK","short_pith_number":"pith:MGG5JJ6V","schema_version":"1.0","canonical_sha256":"618dd4a7d56dd9a39ea795ed9a9941b287e5bc17e6de139f4964c7be0db90c5e","source":{"kind":"arxiv","id":"2606.24877","version":1},"attestation_state":"computed","paper":{"title":"Tur\\'{a}n results for posets and their alternating cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Geir Agnarsson, John B. Kent","submitted_at":"2026-06-23T17:54:28Z","abstract_excerpt":"For a partially ordered set ${\\mathbb{P}} = (X,\\leq)$ there exist hypergraphs where the vertices are the set of ordered tuples of either all incomparable elements of ${\\mathbb{P}}$ or all the critical pairs of ${\\mathbb{P}}$, and the edges are formed by the duals of either all the alternating cycles of ${\\mathbb{P}}$ or all the strict alternating cycles of ${\\mathbb{P}}$. The weak chromatic numbers of these hypergraphs are all equal to the order dimension of ${\\mathbb{P}}$. Here are established upper bounds on the number of strict alternating cycles a poset ${\\mathbb{P}}=(X,\\leq)$ can have in "},"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":"2606.24877","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T17:54:28Z","cross_cats_sorted":[],"title_canon_sha256":"570763f006bdc508687adf58ef6f4de0367728446b13068fd156b1cc033ace43","abstract_canon_sha256":"da22222f70e0e7c09a80fa151122855a37e9c3ecc57ac8d5bd244acf56f4c061"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:15:45.188073Z","signature_b64":"AYEUwsilBbPpjMKDibT1hQJDAlpAv1T80O93sAIZaHtX0lRQ8ik6heRKJ2Ltnix7TUcptkRjESFIOhathDyEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"618dd4a7d56dd9a39ea795ed9a9941b287e5bc17e6de139f4964c7be0db90c5e","last_reissued_at":"2026-06-24T01:15:45.187725Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:15:45.187725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tur\\'{a}n results for posets and their alternating cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Geir Agnarsson, John B. Kent","submitted_at":"2026-06-23T17:54:28Z","abstract_excerpt":"For a partially ordered set ${\\mathbb{P}} = (X,\\leq)$ there exist hypergraphs where the vertices are the set of ordered tuples of either all incomparable elements of ${\\mathbb{P}}$ or all the critical pairs of ${\\mathbb{P}}$, and the edges are formed by the duals of either all the alternating cycles of ${\\mathbb{P}}$ or all the strict alternating cycles of ${\\mathbb{P}}$. The weak chromatic numbers of these hypergraphs are all equal to the order dimension of ${\\mathbb{P}}$. Here are established upper bounds on the number of strict alternating cycles a poset ${\\mathbb{P}}=(X,\\leq)$ can have in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24877","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/2606.24877/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":"2606.24877","created_at":"2026-06-24T01:15:45.187786+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.24877v1","created_at":"2026-06-24T01:15:45.187786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24877","created_at":"2026-06-24T01:15:45.187786+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGG5JJ6VNXM2","created_at":"2026-06-24T01:15:45.187786+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGG5JJ6VNXM2HHVH","created_at":"2026-06-24T01:15:45.187786+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGG5JJ6V","created_at":"2026-06-24T01:15:45.187786+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/MGG5JJ6VNXM2HHVHSXWZVGKBWK","json":"https://pith.science/pith/MGG5JJ6VNXM2HHVHSXWZVGKBWK.json","graph_json":"https://pith.science/api/pith-number/MGG5JJ6VNXM2HHVHSXWZVGKBWK/graph.json","events_json":"https://pith.science/api/pith-number/MGG5JJ6VNXM2HHVHSXWZVGKBWK/events.json","paper":"https://pith.science/paper/MGG5JJ6V"},"agent_actions":{"view_html":"https://pith.science/pith/MGG5JJ6VNXM2HHVHSXWZVGKBWK","download_json":"https://pith.science/pith/MGG5JJ6VNXM2HHVHSXWZVGKBWK.json","view_paper":"https://pith.science/paper/MGG5JJ6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.24877&json=true","fetch_graph":"https://pith.science/api/pith-number/MGG5JJ6VNXM2HHVHSXWZVGKBWK/graph.json","fetch_events":"https://pith.science/api/pith-number/MGG5JJ6VNXM2HHVHSXWZVGKBWK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGG5JJ6VNXM2HHVHSXWZVGKBWK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGG5JJ6VNXM2HHVHSXWZVGKBWK/action/storage_attestation","attest_author":"https://pith.science/pith/MGG5JJ6VNXM2HHVHSXWZVGKBWK/action/author_attestation","sign_citation":"https://pith.science/pith/MGG5JJ6VNXM2HHVHSXWZVGKBWK/action/citation_signature","submit_replication":"https://pith.science/pith/MGG5JJ6VNXM2HHVHSXWZVGKBWK/action/replication_record"}},"created_at":"2026-06-24T01:15:45.187786+00:00","updated_at":"2026-06-24T01:15:45.187786+00:00"}