{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:Q4DGKEQSAM7J2ZVGWSVDEAH5LC","short_pith_number":"pith:Q4DGKEQS","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"},"canonical_sha256":"8706651212033e9d66a6b4aa3200fd5898bc564a7a97d0c2f4b5e95fea2d884a","source":{"kind":"arxiv","id":"2601.08715","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.08715","created_at":"2026-06-05T01:14:33Z"},{"alias_kind":"arxiv_version","alias_value":"2601.08715v3","created_at":"2026-06-05T01:14:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.08715","created_at":"2026-06-05T01:14:33Z"},{"alias_kind":"pith_short_12","alias_value":"Q4DGKEQSAM7J","created_at":"2026-06-05T01:14:33Z"},{"alias_kind":"pith_short_16","alias_value":"Q4DGKEQSAM7J2ZVG","created_at":"2026-06-05T01:14:33Z"},{"alias_kind":"pith_short_8","alias_value":"Q4DGKEQS","created_at":"2026-06-05T01:14:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:Q4DGKEQSAM7J2ZVGWSVDEAH5LC","target":"record","payload":{"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"},"canonical_sha256":"8706651212033e9d66a6b4aa3200fd5898bc564a7a97d0c2f4b5e95fea2d884a","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"},"source_kind":"arxiv","source_id":"2601.08715","source_version":3,"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-06-05T01:14:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c4Nvg41AFONUo3X7Zf7BuWZ8V8TkaRk+IxtW5pvfLSA+iYipPSdsrJ7NjhXNBhWbwJbL/UeH7x4kj4EE9DyRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:56:24.137938Z"},"content_sha256":"7e1dfa871aab871965e17a8baac403155869707162d42238240068df08207637","schema_version":"1.0","event_id":"sha256:7e1dfa871aab871965e17a8baac403155869707162d42238240068df08207637"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:Q4DGKEQSAM7J2ZVGWSVDEAH5LC","target":"graph","payload":{"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"},"verdict_id":"c9c6476f-5884-4d31-b0fc-e9f11f27324f"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-05T01:14:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SgiriYr3MsC7ZbUjcfz7AClk1MlC251KVTvbYzUvA8fRcMsxDjpDTGi4dS5dBV16mS0Y+dxO4RslHKrNxJV7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:56:24.138546Z"},"content_sha256":"0d266d883b98dfbe655aba2f403a093a4f14b498f2eb0f01fe371054f0ff06f1","schema_version":"1.0","event_id":"sha256:0d266d883b98dfbe655aba2f403a093a4f14b498f2eb0f01fe371054f0ff06f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q4DGKEQSAM7J2ZVGWSVDEAH5LC/bundle.json","state_url":"https://pith.science/pith/Q4DGKEQSAM7J2ZVGWSVDEAH5LC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q4DGKEQSAM7J2ZVGWSVDEAH5LC/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-06-10T19:56:24Z","links":{"resolver":"https://pith.science/pith/Q4DGKEQSAM7J2ZVGWSVDEAH5LC","bundle":"https://pith.science/pith/Q4DGKEQSAM7J2ZVGWSVDEAH5LC/bundle.json","state":"https://pith.science/pith/Q4DGKEQSAM7J2ZVGWSVDEAH5LC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q4DGKEQSAM7J2ZVGWSVDEAH5LC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Q4DGKEQSAM7J2ZVGWSVDEAH5LC","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":"12d32e71e35ec2556fcbc92742d655dd9e314e1699260918bb6067154fedb979","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-01-13T16:41:58Z","title_canon_sha256":"effe7737032aae7b2e28ba2b07894fcccd20453e0667b710550af6b5981db833"},"schema_version":"1.0","source":{"id":"2601.08715","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.08715","created_at":"2026-06-05T01:14:33Z"},{"alias_kind":"arxiv_version","alias_value":"2601.08715v3","created_at":"2026-06-05T01:14:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.08715","created_at":"2026-06-05T01:14:33Z"},{"alias_kind":"pith_short_12","alias_value":"Q4DGKEQSAM7J","created_at":"2026-06-05T01:14:33Z"},{"alias_kind":"pith_short_16","alias_value":"Q4DGKEQSAM7J2ZVG","created_at":"2026-06-05T01:14:33Z"},{"alias_kind":"pith_short_8","alias_value":"Q4DGKEQS","created_at":"2026-06-05T01:14:33Z"}],"graph_snapshots":[{"event_id":"sha256:0d266d883b98dfbe655aba2f403a093a4f14b498f2eb0f01fe371054f0ff06f1","target":"graph","created_at":"2026-06-05T01:14:33Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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)"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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)."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The diameter of the Cayley graph of S_n generated by (12), (12…n), (1n…2) is at least n(n-1)/2."}],"snapshot_sha256":"254dac81c3f4f7b5f948b204c5d22ff1f468700c5b721909aad0fa982e28416d"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2601.08715/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Grigorii Antiufeev","cross_cats":["math.GR"],"headline":"The diameter of the Cayley graph of S_n generated by (12), (12…n), (1n…2) is at least n(n-1)/2.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-01-13T16:41:58Z","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)$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.08715","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-16T14:46:50.435951Z","id":"c9c6476f-5884-4d31-b0fc-e9f11f27324f","model_set":{"reader":"grok-4.3"},"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","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.","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)","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)."}},"verdict_id":"c9c6476f-5884-4d31-b0fc-e9f11f27324f"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7e1dfa871aab871965e17a8baac403155869707162d42238240068df08207637","target":"record","created_at":"2026-06-05T01:14:33Z","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":"12d32e71e35ec2556fcbc92742d655dd9e314e1699260918bb6067154fedb979","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-01-13T16:41:58Z","title_canon_sha256":"effe7737032aae7b2e28ba2b07894fcccd20453e0667b710550af6b5981db833"},"schema_version":"1.0","source":{"id":"2601.08715","kind":"arxiv","version":3}},"canonical_sha256":"8706651212033e9d66a6b4aa3200fd5898bc564a7a97d0c2f4b5e95fea2d884a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8706651212033e9d66a6b4aa3200fd5898bc564a7a97d0c2f4b5e95fea2d884a","first_computed_at":"2026-06-05T01:14:33.089162Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-05T01:14:33.089162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mlyorasRKPAuJ5K2pru8BLEwaMI343wD3kj7xt1Cqz3BuaMYAPb19gNDAPC05Ior3ndWUHgAOKw7FBSUcni8Aw==","signature_status":"signed_v1","signed_at":"2026-06-05T01:14:33.089709Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.08715","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e1dfa871aab871965e17a8baac403155869707162d42238240068df08207637","sha256:0d266d883b98dfbe655aba2f403a093a4f14b498f2eb0f01fe371054f0ff06f1"],"state_sha256":"5de5aa9c2d5e75e3dd9720b7ff05438b949924c3c77a0934ebe311716ad8a77c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JgdgY0WK2VrxnJrbkCMl7RsuSJNDdWkXDoHALkgGMdF+VSLS3/lUGiHEJiknJQBJqnVCdDT5xqHVV8BLIUk1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:56:24.141599Z","bundle_sha256":"ccc8e7e3fd10a76c9e6b7c949f0e52e3723fbace0fc09b7c9ac1e03aa6ca5f98"}}