{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:L4JXVKD2CLP5NYK7UZBUBQLRPQ","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":"a4921ed5cd5773480bf4953459d2267fe7e03de8d7019c355edb84325ccfda7d","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-02-15T14:19:27Z","title_canon_sha256":"b3d1edac14b03a2e78c6a2aac26e92a10bb74a4ca4748741cff14ddc29803d51"},"schema_version":"1.0","source":{"id":"1402.3694","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3694","created_at":"2026-05-18T00:29:15Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3694v4","created_at":"2026-05-18T00:29:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3694","created_at":"2026-05-18T00:29:15Z"},{"alias_kind":"pith_short_12","alias_value":"L4JXVKD2CLP5","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"L4JXVKD2CLP5NYK7","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"L4JXVKD2","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:7445b6df2cc213faf66f398bc4444dc0d3134b9c50a2a0ce2065317dd0a2c4ff","target":"graph","created_at":"2026-05-18T00:29:15Z","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 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","authors_text":"Alexandr Polyanskii, Andrey B. Kupavskii","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-02-15T14:19:27Z","title":"Proof of Schur's conjecture in $\\mathbb R^d$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3694","kind":"arxiv","version":4},"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:d5850c862bee8e1edf99b7a3bb9764cd38d28d91b5c6d53d7dd269fe38a44fa1","target":"record","created_at":"2026-05-18T00:29:15Z","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":"a4921ed5cd5773480bf4953459d2267fe7e03de8d7019c355edb84325ccfda7d","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-02-15T14:19:27Z","title_canon_sha256":"b3d1edac14b03a2e78c6a2aac26e92a10bb74a4ca4748741cff14ddc29803d51"},"schema_version":"1.0","source":{"id":"1402.3694","kind":"arxiv","version":4}},"canonical_sha256":"5f137aa87a12dfd6e15fa64340c1717c0a7be53cee27f9e747f485b12b75defe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f137aa87a12dfd6e15fa64340c1717c0a7be53cee27f9e747f485b12b75defe","first_computed_at":"2026-05-18T00:29:15.978329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:15.978329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kmxQaMcwp3mqkKPDraaan5e1A9OmGxORqR2o1lZ88z8aVJMS9MW2MSqK0TRA+uzYqzF0sKmkXMwP2B9oAsFJAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:15.979010Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.3694","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5850c862bee8e1edf99b7a3bb9764cd38d28d91b5c6d53d7dd269fe38a44fa1","sha256:7445b6df2cc213faf66f398bc4444dc0d3134b9c50a2a0ce2065317dd0a2c4ff"],"state_sha256":"33841581b0d527d8e6d25d1df05c1eed54399624d34852fa6b3c60ed95c08584"}