{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ETB2C74WV26ATV4XO47KUV7RAA","short_pith_number":"pith:ETB2C74W","canonical_record":{"source":{"id":"1401.8021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-01-30T23:09:22Z","cross_cats_sorted":[],"title_canon_sha256":"72f3cf297dcd1e28743468b109795560f05591fc3fa871b54756b0b1f7eb7799","abstract_canon_sha256":"02b9530cb755631be42772f47122116a82552c6e504bcf0edea6959fe3855e59"},"schema_version":"1.0"},"canonical_sha256":"24c3a17f96aebc09d797773eaa57f1002199dc8a31a6ff053b6fff47e2495a45","source":{"kind":"arxiv","id":"1401.8021","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.8021","created_at":"2026-05-18T03:00:36Z"},{"alias_kind":"arxiv_version","alias_value":"1401.8021v1","created_at":"2026-05-18T03:00:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.8021","created_at":"2026-05-18T03:00:36Z"},{"alias_kind":"pith_short_12","alias_value":"ETB2C74WV26A","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"ETB2C74WV26ATV4X","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"ETB2C74W","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ETB2C74WV26ATV4XO47KUV7RAA","target":"record","payload":{"canonical_record":{"source":{"id":"1401.8021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-01-30T23:09:22Z","cross_cats_sorted":[],"title_canon_sha256":"72f3cf297dcd1e28743468b109795560f05591fc3fa871b54756b0b1f7eb7799","abstract_canon_sha256":"02b9530cb755631be42772f47122116a82552c6e504bcf0edea6959fe3855e59"},"schema_version":"1.0"},"canonical_sha256":"24c3a17f96aebc09d797773eaa57f1002199dc8a31a6ff053b6fff47e2495a45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:36.465460Z","signature_b64":"Xx0ZfouW+V/gPPvRg5vRhIUgngBJ78krP14pwTq77CpyAXmTa8P+BOMmXYLOZWW6+1nrL/dqV+QEHQ7FhwC1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24c3a17f96aebc09d797773eaa57f1002199dc8a31a6ff053b6fff47e2495a45","last_reissued_at":"2026-05-18T03:00:36.464520Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:36.464520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.8021","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:00:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OI0PQhmr6mJnYYU6skNvV7RqxRNtYqM3x6mdT9S+HC2V/jdesZje5Xl4nu72DSpAtjftxyZnGTbVWnq01gY8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:26:13.387794Z"},"content_sha256":"0f947a5c58f8c632b67696737c7cd18730bae7add815fdd13ca080fb00388a92","schema_version":"1.0","event_id":"sha256:0f947a5c58f8c632b67696737c7cd18730bae7add815fdd13ca080fb00388a92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ETB2C74WV26ATV4XO47KUV7RAA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal zero-sum sequences of length four over cyclic group with order $n=p^\\alpha q^\\beta$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Caixia Shen, Li-meng Xia","submitted_at":"2014-01-30T23:09:22Z","abstract_excerpt":"Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\\cdot...\\cdot(n_kg)$ where $g\\in G$ and $n_1,\\cdots,n_k\\in[1,{\\hbox{\\rm ord}}(g)]$, and the index $\\ind S$ of $S$ is defined to be the minimum of $(n_1+\\cdots+n_k)/\\hbox{\\rm ord}(g)$ over all possible $g\\in G$ such that $\\langle g\\rangle=G$. A conjecture says that if $G$ is finite such that $\\gcd(|G|,6)=1$, then $\\ind(S)=1$ for every minimal zero-sum sequence $S$. In this paper, we prove that the conjecture holds if $|G|$ has two prime factors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.8021","kind":"arxiv","version":1},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:00:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U17Np2LzBQtJYuFue06C0tLfFtsHsybDy7/CGolSdMXv0DbyjXaG4RBQHosHVMkvvt3d9bJKcjIisukanpmLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:26:13.388561Z"},"content_sha256":"e1aa052e2119730a3cad459d62c3d9fa78e4b7b241bbee53612c1f5025ee8411","schema_version":"1.0","event_id":"sha256:e1aa052e2119730a3cad459d62c3d9fa78e4b7b241bbee53612c1f5025ee8411"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ETB2C74WV26ATV4XO47KUV7RAA/bundle.json","state_url":"https://pith.science/pith/ETB2C74WV26ATV4XO47KUV7RAA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ETB2C74WV26ATV4XO47KUV7RAA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T20:26:13Z","links":{"resolver":"https://pith.science/pith/ETB2C74WV26ATV4XO47KUV7RAA","bundle":"https://pith.science/pith/ETB2C74WV26ATV4XO47KUV7RAA/bundle.json","state":"https://pith.science/pith/ETB2C74WV26ATV4XO47KUV7RAA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ETB2C74WV26ATV4XO47KUV7RAA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ETB2C74WV26ATV4XO47KUV7RAA","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":"02b9530cb755631be42772f47122116a82552c6e504bcf0edea6959fe3855e59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-01-30T23:09:22Z","title_canon_sha256":"72f3cf297dcd1e28743468b109795560f05591fc3fa871b54756b0b1f7eb7799"},"schema_version":"1.0","source":{"id":"1401.8021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.8021","created_at":"2026-05-18T03:00:36Z"},{"alias_kind":"arxiv_version","alias_value":"1401.8021v1","created_at":"2026-05-18T03:00:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.8021","created_at":"2026-05-18T03:00:36Z"},{"alias_kind":"pith_short_12","alias_value":"ETB2C74WV26A","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"ETB2C74WV26ATV4X","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"ETB2C74W","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:e1aa052e2119730a3cad459d62c3d9fa78e4b7b241bbee53612c1f5025ee8411","target":"graph","created_at":"2026-05-18T03:00:36Z","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. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\\cdot...\\cdot(n_kg)$ where $g\\in G$ and $n_1,\\cdots,n_k\\in[1,{\\hbox{\\rm ord}}(g)]$, and the index $\\ind S$ of $S$ is defined to be the minimum of $(n_1+\\cdots+n_k)/\\hbox{\\rm ord}(g)$ over all possible $g\\in G$ such that $\\langle g\\rangle=G$. A conjecture says that if $G$ is finite such that $\\gcd(|G|,6)=1$, then $\\ind(S)=1$ for every minimal zero-sum sequence $S$. In this paper, we prove that the conjecture holds if $|G|$ has two prime factors.","authors_text":"Caixia Shen, Li-meng Xia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-01-30T23:09:22Z","title":"Minimal zero-sum sequences of length four over cyclic group with order $n=p^\\alpha q^\\beta$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.8021","kind":"arxiv","version":1},"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:0f947a5c58f8c632b67696737c7cd18730bae7add815fdd13ca080fb00388a92","target":"record","created_at":"2026-05-18T03:00:36Z","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":"02b9530cb755631be42772f47122116a82552c6e504bcf0edea6959fe3855e59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-01-30T23:09:22Z","title_canon_sha256":"72f3cf297dcd1e28743468b109795560f05591fc3fa871b54756b0b1f7eb7799"},"schema_version":"1.0","source":{"id":"1401.8021","kind":"arxiv","version":1}},"canonical_sha256":"24c3a17f96aebc09d797773eaa57f1002199dc8a31a6ff053b6fff47e2495a45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24c3a17f96aebc09d797773eaa57f1002199dc8a31a6ff053b6fff47e2495a45","first_computed_at":"2026-05-18T03:00:36.464520Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:36.464520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xx0ZfouW+V/gPPvRg5vRhIUgngBJ78krP14pwTq77CpyAXmTa8P+BOMmXYLOZWW6+1nrL/dqV+QEHQ7FhwC1DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:36.465460Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.8021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f947a5c58f8c632b67696737c7cd18730bae7add815fdd13ca080fb00388a92","sha256:e1aa052e2119730a3cad459d62c3d9fa78e4b7b241bbee53612c1f5025ee8411"],"state_sha256":"6bd96805eeaaca5b8e17a1877c05ac8c325eefb14df9bacc296de963902a0725"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eB+Zh4qW37SJp4aATjAGgh//Pt/59n4rYkR8xCKAOIi+/SO6IzG88pOwjY5dyDhFE2G6v7I+gJCgw/8q6K65Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:26:13.392594Z","bundle_sha256":"c5f2dede712d72c9fdcca56b4d724c5e673cca8ead2ee8cd4901c1eb5adc9d44"}}