{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:FX44LORCFBCTGG5FHYCMVZFN3P","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":"372843c92c7b1a60297959c07d3c64c6993e61fc3c27cf1b1eb78756444cc85b","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-09-14T02:18:06Z","title_canon_sha256":"0acf72038ea1280c2f4ae87507451a5d07af9863d550ab277e59677083046b71"},"schema_version":"1.0","source":{"id":"0909.2461","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.2461","created_at":"2026-05-18T04:27:02Z"},{"alias_kind":"arxiv_version","alias_value":"0909.2461v2","created_at":"2026-05-18T04:27:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.2461","created_at":"2026-05-18T04:27:02Z"},{"alias_kind":"pith_short_12","alias_value":"FX44LORCFBCT","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"FX44LORCFBCTGG5F","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"FX44LORC","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:9a0f97844360e8730a883be4b23dd75d2ede884dcd2f4df3651f30eaa2bd0187","target":"graph","created_at":"2026-05-18T04:27:02Z","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":"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","authors_text":"Chris Plyley, Guoqing Wang, Jiangtao Peng, Weidong Gao, Yuanlin Li","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-09-14T02:18:06Z","title":"On the Index of Sequences over Cyclic Groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.2461","kind":"arxiv","version":2},"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:067c3643d20c58ba962fbb9c8a5a83e384d29b439daf848e463df2f96ba3b18c","target":"record","created_at":"2026-05-18T04:27:02Z","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":"372843c92c7b1a60297959c07d3c64c6993e61fc3c27cf1b1eb78756444cc85b","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-09-14T02:18:06Z","title_canon_sha256":"0acf72038ea1280c2f4ae87507451a5d07af9863d550ab277e59677083046b71"},"schema_version":"1.0","source":{"id":"0909.2461","kind":"arxiv","version":2}},"canonical_sha256":"2df9c5ba222845331ba53e04cae4addbe5ed1483a8041fea1b6284eafe0844a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2df9c5ba222845331ba53e04cae4addbe5ed1483a8041fea1b6284eafe0844a4","first_computed_at":"2026-05-18T04:27:02.728238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:02.728238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"omxQGLH+Fhfb6HG0dcd5vwMfCjDT08RcXg1yVZICJsABDDpANpaORR2ldPdVIZFW+5qNtGKRAabnDOKs9rGfCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:02.728905Z","signed_message":"canonical_sha256_bytes"},"source_id":"0909.2461","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:067c3643d20c58ba962fbb9c8a5a83e384d29b439daf848e463df2f96ba3b18c","sha256:9a0f97844360e8730a883be4b23dd75d2ede884dcd2f4df3651f30eaa2bd0187"],"state_sha256":"db9d6131b3aef883ae54e470483f3f9b83d82bf183f24d2700f2f866f64bb05c"}