{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EX7IACGPW7DKFN6R6CUKNALTTG","short_pith_number":"pith:EX7IACGP","schema_version":"1.0","canonical_sha256":"25fe8008cfb7c6a2b7d1f0a8a6817399a22930bff1d97207a28677030650bd1f","source":{"kind":"arxiv","id":"1309.1679","version":9},"attestation_state":"computed","paper":{"title":"Some new problems in additive combinatorics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Zhi-Wei Sun","submitted_at":"2013-09-06T15:48:06Z","abstract_excerpt":"In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\\ldots,a_n$ with adjacent sums $a_i+a_{i+1}$ (or differences $a_i-a_{i+1}$) pairwise distinct. For an odd prime power $q=2n+1>13$ with $q\\not=25$, we show that there is a circular permutation $(a_1,\\ldots,a_n)$ of the elements of $S=\\{a^2:\\ a\\in\\mathbb F_q\\setminus\\{0\\}\\}$ such that $\\{a_1+a_2,\\ldots,a_{n-1}+a_n,a_n+a_1\\}=S$, where $\\mathbb F_q$ denotes the field of order $q$. For any f"},"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":"1309.1679","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-09-06T15:48:06Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"14fb3a7166394b53afb0ed220de29c825bd19f33421ec6b1ec4fb5cfd1a78ee5","abstract_canon_sha256":"c82bfc330b699703b9b4400901715d3b1ee369ced87eba8b0a32b6bd3a6b17ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:44:55.337356Z","signature_b64":"drV7WiDolDxzRSZ1+uXXruOeDXhd8jRFauE3h5gRbvon/YREcZ1tTdiE7IVxxs3VIA0C57CoOHxF8UQY1hzqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25fe8008cfb7c6a2b7d1f0a8a6817399a22930bff1d97207a28677030650bd1f","last_reissued_at":"2026-07-05T00:44:55.336965Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:44:55.336965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some new problems in additive combinatorics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Zhi-Wei Sun","submitted_at":"2013-09-06T15:48:06Z","abstract_excerpt":"In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\\ldots,a_n$ with adjacent sums $a_i+a_{i+1}$ (or differences $a_i-a_{i+1}$) pairwise distinct. For an odd prime power $q=2n+1>13$ with $q\\not=25$, we show that there is a circular permutation $(a_1,\\ldots,a_n)$ of the elements of $S=\\{a^2:\\ a\\in\\mathbb F_q\\setminus\\{0\\}\\}$ such that $\\{a_1+a_2,\\ldots,a_{n-1}+a_n,a_n+a_1\\}=S$, where $\\mathbb F_q$ denotes the field of order $q$. For any f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1679","kind":"arxiv","version":9},"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/1309.1679/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":"1309.1679","created_at":"2026-07-05T00:44:55.337026+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.1679v9","created_at":"2026-07-05T00:44:55.337026+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1679","created_at":"2026-07-05T00:44:55.337026+00:00"},{"alias_kind":"pith_short_12","alias_value":"EX7IACGPW7DK","created_at":"2026-07-05T00:44:55.337026+00:00"},{"alias_kind":"pith_short_16","alias_value":"EX7IACGPW7DKFN6R","created_at":"2026-07-05T00:44:55.337026+00:00"},{"alias_kind":"pith_short_8","alias_value":"EX7IACGP","created_at":"2026-07-05T00:44:55.337026+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/EX7IACGPW7DKFN6R6CUKNALTTG","json":"https://pith.science/pith/EX7IACGPW7DKFN6R6CUKNALTTG.json","graph_json":"https://pith.science/api/pith-number/EX7IACGPW7DKFN6R6CUKNALTTG/graph.json","events_json":"https://pith.science/api/pith-number/EX7IACGPW7DKFN6R6CUKNALTTG/events.json","paper":"https://pith.science/paper/EX7IACGP"},"agent_actions":{"view_html":"https://pith.science/pith/EX7IACGPW7DKFN6R6CUKNALTTG","download_json":"https://pith.science/pith/EX7IACGPW7DKFN6R6CUKNALTTG.json","view_paper":"https://pith.science/paper/EX7IACGP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.1679&json=true","fetch_graph":"https://pith.science/api/pith-number/EX7IACGPW7DKFN6R6CUKNALTTG/graph.json","fetch_events":"https://pith.science/api/pith-number/EX7IACGPW7DKFN6R6CUKNALTTG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EX7IACGPW7DKFN6R6CUKNALTTG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EX7IACGPW7DKFN6R6CUKNALTTG/action/storage_attestation","attest_author":"https://pith.science/pith/EX7IACGPW7DKFN6R6CUKNALTTG/action/author_attestation","sign_citation":"https://pith.science/pith/EX7IACGPW7DKFN6R6CUKNALTTG/action/citation_signature","submit_replication":"https://pith.science/pith/EX7IACGPW7DKFN6R6CUKNALTTG/action/replication_record"}},"created_at":"2026-07-05T00:44:55.337026+00:00","updated_at":"2026-07-05T00:44:55.337026+00:00"}