{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KEZ2EWPSZKTKPORTRWEGVLIVGU","short_pith_number":"pith:KEZ2EWPS","schema_version":"1.0","canonical_sha256":"5133a259f2caa6a7ba338d886aad15353b0445414dc8c920fc56fce0a6992032","source":{"kind":"arxiv","id":"1308.2364","version":1},"attestation_state":"computed","paper":{"title":"An upper bound for Davenport constant of finite groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Jiangtao Peng, Weidong Gao, Yuanlin Li","submitted_at":"2013-08-11T05:03:02Z","abstract_excerpt":"Let $G$ be a finite (not necessarily abelian) group and let $p=p(G)$ be the smallest prime number dividing $|G|$. We prove that $d(G)\\leq \\frac{|G|}{p}+9p^2-10p$, where $d(G)$ denotes the small Davenport constant of $G$ which is defined as the maximal integer $\\ell$ such that there is a sequence over $G$ of length $\\ell$ contains no nonempty one-product subsequence."},"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":"1308.2364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-08-11T05:03:02Z","cross_cats_sorted":[],"title_canon_sha256":"167d1cb4fd08a23ad4689009840761d68d38361ed8b3477819b13aedbc6cb7ee","abstract_canon_sha256":"2d6100323349fc1118462aaefd197e7019acfe34ad972f585f919a191848878b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:07.666439Z","signature_b64":"7HrEpDokdD3Go3O+2b7LmvL3rFio1QdQ2WdKTClbqk/Nu5ZVy11Jttmr/EFw6/42TjqhrqaGX7eqrQaewXeVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5133a259f2caa6a7ba338d886aad15353b0445414dc8c920fc56fce0a6992032","last_reissued_at":"2026-05-18T03:16:07.665761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:07.665761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An upper bound for Davenport constant of finite groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Jiangtao Peng, Weidong Gao, Yuanlin Li","submitted_at":"2013-08-11T05:03:02Z","abstract_excerpt":"Let $G$ be a finite (not necessarily abelian) group and let $p=p(G)$ be the smallest prime number dividing $|G|$. We prove that $d(G)\\leq \\frac{|G|}{p}+9p^2-10p$, where $d(G)$ denotes the small Davenport constant of $G$ which is defined as the maximal integer $\\ell$ such that there is a sequence over $G$ of length $\\ell$ contains no nonempty one-product subsequence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2364","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.2364","created_at":"2026-05-18T03:16:07.665862+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.2364v1","created_at":"2026-05-18T03:16:07.665862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2364","created_at":"2026-05-18T03:16:07.665862+00:00"},{"alias_kind":"pith_short_12","alias_value":"KEZ2EWPSZKTK","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"KEZ2EWPSZKTKPORT","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"KEZ2EWPS","created_at":"2026-05-18T12:27:49.015174+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/KEZ2EWPSZKTKPORTRWEGVLIVGU","json":"https://pith.science/pith/KEZ2EWPSZKTKPORTRWEGVLIVGU.json","graph_json":"https://pith.science/api/pith-number/KEZ2EWPSZKTKPORTRWEGVLIVGU/graph.json","events_json":"https://pith.science/api/pith-number/KEZ2EWPSZKTKPORTRWEGVLIVGU/events.json","paper":"https://pith.science/paper/KEZ2EWPS"},"agent_actions":{"view_html":"https://pith.science/pith/KEZ2EWPSZKTKPORTRWEGVLIVGU","download_json":"https://pith.science/pith/KEZ2EWPSZKTKPORTRWEGVLIVGU.json","view_paper":"https://pith.science/paper/KEZ2EWPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.2364&json=true","fetch_graph":"https://pith.science/api/pith-number/KEZ2EWPSZKTKPORTRWEGVLIVGU/graph.json","fetch_events":"https://pith.science/api/pith-number/KEZ2EWPSZKTKPORTRWEGVLIVGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KEZ2EWPSZKTKPORTRWEGVLIVGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KEZ2EWPSZKTKPORTRWEGVLIVGU/action/storage_attestation","attest_author":"https://pith.science/pith/KEZ2EWPSZKTKPORTRWEGVLIVGU/action/author_attestation","sign_citation":"https://pith.science/pith/KEZ2EWPSZKTKPORTRWEGVLIVGU/action/citation_signature","submit_replication":"https://pith.science/pith/KEZ2EWPSZKTKPORTRWEGVLIVGU/action/replication_record"}},"created_at":"2026-05-18T03:16:07.665862+00:00","updated_at":"2026-05-18T03:16:07.665862+00:00"}