{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:Q4DGKEQSAM7J2ZVGWSVDEAH5LC","short_pith_number":"pith:Q4DGKEQS","schema_version":"1.0","canonical_sha256":"8706651212033e9d66a6b4aa3200fd5898bc564a7a97d0c2f4b5e95fea2d884a","source":{"kind":"arxiv","id":"2601.08715","version":3},"attestation_state":"computed","paper":{"title":"A Lower Bound for the Diameter of Cayley Graph of the Symmetric Group $S_n$ Generated by $(12), (12 \\dots n), (1n \\dots 2)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The diameter of the Cayley graph of S_n generated by (12), (12…n), (1n…2) is at least n(n-1)/2.","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Grigorii Antiufeev","submitted_at":"2026-01-13T16:41:58Z","abstract_excerpt":"Let us denote elements of the symmetric group $S_n$ using square brackets for the one-line notation. Cycles will be represented using parentheses, following the standard cycle notation. Under this convention, the full reversal of the identity element $()$ is the element $s = [n\\ n-1 \\dots 1]$. In the present work, we obtain a lower bound on the decomposition complexity of elements $s(1n \\dots 2)^{i}$ into the generators $(12), (12 \\dots n), (1n \\dots 2)$, where $i$ ranges over the set $\\{1,2,\\dots,n\\}$. As a consequence, we derive the lower bound $n(n-1)/2$ for the diameter of Cayley graph of "},"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":"2601.08715","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-01-13T16:41:58Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"effe7737032aae7b2e28ba2b07894fcccd20453e0667b710550af6b5981db833","abstract_canon_sha256":"12d32e71e35ec2556fcbc92742d655dd9e314e1699260918bb6067154fedb979"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:14:33.089709Z","signature_b64":"mlyorasRKPAuJ5K2pru8BLEwaMI343wD3kj7xt1Cqz3BuaMYAPb19gNDAPC05Ior3ndWUHgAOKw7FBSUcni8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8706651212033e9d66a6b4aa3200fd5898bc564a7a97d0c2f4b5e95fea2d884a","last_reissued_at":"2026-06-05T01:14:33.089162Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:14:33.089162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Lower Bound for the Diameter of Cayley Graph of the Symmetric Group $S_n$ Generated by $(12), (12 \\dots n), (1n \\dots 2)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The diameter of the Cayley graph of S_n generated by (12), (12…n), (1n…2) is at least n(n-1)/2.","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Grigorii Antiufeev","submitted_at":"2026-01-13T16:41:58Z","abstract_excerpt":"Let us denote elements of the symmetric group $S_n$ using square brackets for the one-line notation. Cycles will be represented using parentheses, following the standard cycle notation. Under this convention, the full reversal of the identity element $()$ is the element $s = [n\\ n-1 \\dots 1]$. In the present work, we obtain a lower bound on the decomposition complexity of elements $s(1n \\dots 2)^{i}$ into the generators $(12), (12 \\dots n), (1n \\dots 2)$, where $i$ ranges over the set $\\{1,2,\\dots,n\\}$. As a consequence, we derive the lower bound $n(n-1)/2$ for the diameter of Cayley graph of "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we derive the lower bound n(n-1)/2 for the diameter of Cayley graph of the group S_n generated by (12), (12 … n), (1n … 2)","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That a lower bound on the word length of the specific family s(1n…2)^i for i=1 to n is sufficient to lower-bound the diameter of the entire Cayley graph (i.e., that the diameter is realized or exceeded by one of these elements).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A lower bound of n(n-1)/2 is established for the diameter of the Cayley graph of S_n generated by (12), (12...n), and (1n...2).","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The diameter of the Cayley graph of S_n generated by (12), (12…n), (1n…2) is at least n(n-1)/2.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"254dac81c3f4f7b5f948b204c5d22ff1f468700c5b721909aad0fa982e28416d"},"source":{"id":"2601.08715","kind":"arxiv","version":3},"verdict":{"id":"c9c6476f-5884-4d31-b0fc-e9f11f27324f","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T14:46:50.435951Z","strongest_claim":"we derive the lower bound n(n-1)/2 for the diameter of Cayley graph of the group S_n generated by (12), (12 … n), (1n … 2)","one_line_summary":"A lower bound of n(n-1)/2 is established for the diameter of the Cayley graph of S_n generated by (12), (12...n), and (1n...2).","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That a lower bound on the word length of the specific family s(1n…2)^i for i=1 to n is sufficient to lower-bound the diameter of the entire Cayley graph (i.e., that the diameter is realized or exceeded by one of these elements).","pith_extraction_headline":"The diameter of the Cayley graph of S_n generated by (12), (12…n), (1n…2) is at least n(n-1)/2."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.08715/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":"2601.08715","created_at":"2026-06-05T01:14:33.089226+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.08715v3","created_at":"2026-06-05T01:14:33.089226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.08715","created_at":"2026-06-05T01:14:33.089226+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q4DGKEQSAM7J","created_at":"2026-06-05T01:14:33.089226+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q4DGKEQSAM7J2ZVG","created_at":"2026-06-05T01:14:33.089226+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q4DGKEQS","created_at":"2026-06-05T01:14:33.089226+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/Q4DGKEQSAM7J2ZVGWSVDEAH5LC","json":"https://pith.science/pith/Q4DGKEQSAM7J2ZVGWSVDEAH5LC.json","graph_json":"https://pith.science/api/pith-number/Q4DGKEQSAM7J2ZVGWSVDEAH5LC/graph.json","events_json":"https://pith.science/api/pith-number/Q4DGKEQSAM7J2ZVGWSVDEAH5LC/events.json","paper":"https://pith.science/paper/Q4DGKEQS"},"agent_actions":{"view_html":"https://pith.science/pith/Q4DGKEQSAM7J2ZVGWSVDEAH5LC","download_json":"https://pith.science/pith/Q4DGKEQSAM7J2ZVGWSVDEAH5LC.json","view_paper":"https://pith.science/paper/Q4DGKEQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.08715&json=true","fetch_graph":"https://pith.science/api/pith-number/Q4DGKEQSAM7J2ZVGWSVDEAH5LC/graph.json","fetch_events":"https://pith.science/api/pith-number/Q4DGKEQSAM7J2ZVGWSVDEAH5LC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q4DGKEQSAM7J2ZVGWSVDEAH5LC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q4DGKEQSAM7J2ZVGWSVDEAH5LC/action/storage_attestation","attest_author":"https://pith.science/pith/Q4DGKEQSAM7J2ZVGWSVDEAH5LC/action/author_attestation","sign_citation":"https://pith.science/pith/Q4DGKEQSAM7J2ZVGWSVDEAH5LC/action/citation_signature","submit_replication":"https://pith.science/pith/Q4DGKEQSAM7J2ZVGWSVDEAH5LC/action/replication_record"}},"created_at":"2026-06-05T01:14:33.089226+00:00","updated_at":"2026-06-05T01:14:33.089226+00:00"}