{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:L4JXVKD2CLP5NYK7UZBUBQLRPQ","short_pith_number":"pith:L4JXVKD2","schema_version":"1.0","canonical_sha256":"5f137aa87a12dfd6e15fa64340c1717c0a7be53cee27f9e747f485b12b75defe","source":{"kind":"arxiv","id":"1402.3694","version":4},"attestation_state":"computed","paper":{"title":"Proof of Schur's conjecture in $\\mathbb R^d$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.MG","authors_text":"Alexandr Polyanskii, Andrey B. Kupavskii","submitted_at":"2014-02-15T14:19:27Z","abstract_excerpt":"In this paper we prove Schur's conjecture in $\\mathbb R^d$, which states that any diameter graph $G$ in the Euclidean space $\\mathbb R^d$ on $n$ vertices may have at most $n$ cliques of size $d$. We obtain an analogous statement for diameter graphs with unit edge length on a sphere $S^d_r$ of radius $r>1/\\sqrt 2$. The proof rests on the following statement, conjectured by F. Mori\\'c and J. Pach: given two unit regular simplices $\\Delta_1,\\Delta_2$ on $d$ vertices in $\\mathbb R^d$, either they share $d-2$ vertices, or there are vertices $v_1\\in \\Delta_1,v_2\\in \\Delta_2$ such that $\\|v_1-v_2\\|>1"},"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":"1402.3694","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-02-15T14:19:27Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"b3d1edac14b03a2e78c6a2aac26e92a10bb74a4ca4748741cff14ddc29803d51","abstract_canon_sha256":"a4921ed5cd5773480bf4953459d2267fe7e03de8d7019c355edb84325ccfda7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:15.979010Z","signature_b64":"kmxQaMcwp3mqkKPDraaan5e1A9OmGxORqR2o1lZ88z8aVJMS9MW2MSqK0TRA+uzYqzF0sKmkXMwP2B9oAsFJAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f137aa87a12dfd6e15fa64340c1717c0a7be53cee27f9e747f485b12b75defe","last_reissued_at":"2026-05-18T00:29:15.978329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:15.978329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proof of Schur's conjecture in $\\mathbb R^d$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.MG","authors_text":"Alexandr Polyanskii, Andrey B. Kupavskii","submitted_at":"2014-02-15T14:19:27Z","abstract_excerpt":"In this paper we prove Schur's conjecture in $\\mathbb R^d$, which states that any diameter graph $G$ in the Euclidean space $\\mathbb R^d$ on $n$ vertices may have at most $n$ cliques of size $d$. We obtain an analogous statement for diameter graphs with unit edge length on a sphere $S^d_r$ of radius $r>1/\\sqrt 2$. The proof rests on the following statement, conjectured by F. Mori\\'c and J. Pach: given two unit regular simplices $\\Delta_1,\\Delta_2$ on $d$ vertices in $\\mathbb R^d$, either they share $d-2$ vertices, or there are vertices $v_1\\in \\Delta_1,v_2\\in \\Delta_2$ such that $\\|v_1-v_2\\|>1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3694","kind":"arxiv","version":4},"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":"1402.3694","created_at":"2026-05-18T00:29:15.978448+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3694v4","created_at":"2026-05-18T00:29:15.978448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3694","created_at":"2026-05-18T00:29:15.978448+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4JXVKD2CLP5","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4JXVKD2CLP5NYK7","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4JXVKD2","created_at":"2026-05-18T12:28:35.611951+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/L4JXVKD2CLP5NYK7UZBUBQLRPQ","json":"https://pith.science/pith/L4JXVKD2CLP5NYK7UZBUBQLRPQ.json","graph_json":"https://pith.science/api/pith-number/L4JXVKD2CLP5NYK7UZBUBQLRPQ/graph.json","events_json":"https://pith.science/api/pith-number/L4JXVKD2CLP5NYK7UZBUBQLRPQ/events.json","paper":"https://pith.science/paper/L4JXVKD2"},"agent_actions":{"view_html":"https://pith.science/pith/L4JXVKD2CLP5NYK7UZBUBQLRPQ","download_json":"https://pith.science/pith/L4JXVKD2CLP5NYK7UZBUBQLRPQ.json","view_paper":"https://pith.science/paper/L4JXVKD2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3694&json=true","fetch_graph":"https://pith.science/api/pith-number/L4JXVKD2CLP5NYK7UZBUBQLRPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/L4JXVKD2CLP5NYK7UZBUBQLRPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4JXVKD2CLP5NYK7UZBUBQLRPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4JXVKD2CLP5NYK7UZBUBQLRPQ/action/storage_attestation","attest_author":"https://pith.science/pith/L4JXVKD2CLP5NYK7UZBUBQLRPQ/action/author_attestation","sign_citation":"https://pith.science/pith/L4JXVKD2CLP5NYK7UZBUBQLRPQ/action/citation_signature","submit_replication":"https://pith.science/pith/L4JXVKD2CLP5NYK7UZBUBQLRPQ/action/replication_record"}},"created_at":"2026-05-18T00:29:15.978448+00:00","updated_at":"2026-05-18T00:29:15.978448+00:00"}