{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:FX44LORCFBCTGG5FHYCMVZFN3P","short_pith_number":"pith:FX44LORC","schema_version":"1.0","canonical_sha256":"2df9c5ba222845331ba53e04cae4addbe5ed1483a8041fea1b6284eafe0844a4","source":{"kind":"arxiv","id":"0909.2461","version":2},"attestation_state":"computed","paper":{"title":"On the Index of Sequences over Cyclic Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Chris Plyley, Guoqing Wang, Jiangtao Peng, Weidong Gao, Yuanlin Li","submitted_at":"2009-09-14T02:18:06Z","abstract_excerpt":"Let $G$ be a finite cyclic group of order $n \\ge 2$. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\\cdot ... \\cdot (n_lg)$ where $g\\in G$ and $n_1,..., n_l \\in [1,\\ord(g)]$, and the index $\\ind (S)$ of $S$ is defined as the minimum of $(n_1+ ... + n_l)/\\ord (g)$ over all $g \\in G$ with $\\ord (g) = n$. In this paper we prove that a sequence $S$ over $G$ of length $|S| = n$ having an element with multiplicity at least $\\frac{n}{2}$ has a subsequence $T$ with $\\ind (T) = 1$, and if the group order $n$ is a prime, then the assumption on the multiplicity can be relaxed to $\\frac{n"},"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":"0909.2461","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-09-14T02:18:06Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"0acf72038ea1280c2f4ae87507451a5d07af9863d550ab277e59677083046b71","abstract_canon_sha256":"372843c92c7b1a60297959c07d3c64c6993e61fc3c27cf1b1eb78756444cc85b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:02.728905Z","signature_b64":"omxQGLH+Fhfb6HG0dcd5vwMfCjDT08RcXg1yVZICJsABDDpANpaORR2ldPdVIZFW+5qNtGKRAabnDOKs9rGfCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2df9c5ba222845331ba53e04cae4addbe5ed1483a8041fea1b6284eafe0844a4","last_reissued_at":"2026-05-18T04:27:02.728238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:02.728238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Index of Sequences over Cyclic Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Chris Plyley, Guoqing Wang, Jiangtao Peng, Weidong Gao, Yuanlin Li","submitted_at":"2009-09-14T02:18:06Z","abstract_excerpt":"Let $G$ be a finite cyclic group of order $n \\ge 2$. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\\cdot ... \\cdot (n_lg)$ where $g\\in G$ and $n_1,..., n_l \\in [1,\\ord(g)]$, and the index $\\ind (S)$ of $S$ is defined as the minimum of $(n_1+ ... + n_l)/\\ord (g)$ over all $g \\in G$ with $\\ord (g) = n$. In this paper we prove that a sequence $S$ over $G$ of length $|S| = n$ having an element with multiplicity at least $\\frac{n}{2}$ has a subsequence $T$ with $\\ind (T) = 1$, and if the group order $n$ is a prime, then the assumption on the multiplicity can be relaxed to $\\frac{n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.2461","kind":"arxiv","version":2},"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":"0909.2461","created_at":"2026-05-18T04:27:02.728362+00:00"},{"alias_kind":"arxiv_version","alias_value":"0909.2461v2","created_at":"2026-05-18T04:27:02.728362+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.2461","created_at":"2026-05-18T04:27:02.728362+00:00"},{"alias_kind":"pith_short_12","alias_value":"FX44LORCFBCT","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"FX44LORCFBCTGG5F","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"FX44LORC","created_at":"2026-05-18T12:25:59.703012+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/FX44LORCFBCTGG5FHYCMVZFN3P","json":"https://pith.science/pith/FX44LORCFBCTGG5FHYCMVZFN3P.json","graph_json":"https://pith.science/api/pith-number/FX44LORCFBCTGG5FHYCMVZFN3P/graph.json","events_json":"https://pith.science/api/pith-number/FX44LORCFBCTGG5FHYCMVZFN3P/events.json","paper":"https://pith.science/paper/FX44LORC"},"agent_actions":{"view_html":"https://pith.science/pith/FX44LORCFBCTGG5FHYCMVZFN3P","download_json":"https://pith.science/pith/FX44LORCFBCTGG5FHYCMVZFN3P.json","view_paper":"https://pith.science/paper/FX44LORC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0909.2461&json=true","fetch_graph":"https://pith.science/api/pith-number/FX44LORCFBCTGG5FHYCMVZFN3P/graph.json","fetch_events":"https://pith.science/api/pith-number/FX44LORCFBCTGG5FHYCMVZFN3P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FX44LORCFBCTGG5FHYCMVZFN3P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FX44LORCFBCTGG5FHYCMVZFN3P/action/storage_attestation","attest_author":"https://pith.science/pith/FX44LORCFBCTGG5FHYCMVZFN3P/action/author_attestation","sign_citation":"https://pith.science/pith/FX44LORCFBCTGG5FHYCMVZFN3P/action/citation_signature","submit_replication":"https://pith.science/pith/FX44LORCFBCTGG5FHYCMVZFN3P/action/replication_record"}},"created_at":"2026-05-18T04:27:02.728362+00:00","updated_at":"2026-05-18T04:27:02.728362+00:00"}