{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V3M5TT6QGVWJJTMVFZUPKI6DGT","short_pith_number":"pith:V3M5TT6Q","schema_version":"1.0","canonical_sha256":"aed9d9cfd0356c94cd952e68f523c334cc48c88333161cc75636d02a2c9229c2","source":{"kind":"arxiv","id":"1706.09972","version":1},"attestation_state":"computed","paper":{"title":"The trivial lower bound for the girth of $S_n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Sean Eberhard","submitted_at":"2017-06-29T22:26:47Z","abstract_excerpt":"Consider the Cayley graph of $S_n$ generated by a random pair of elements $x,y$. Conjecturally, the girth of this graph is $\\Omega(n \\log n)$ with probability tending to $1$ as $n\\to\\infty$. We show that it is at least $\\Omega(n^{1/3})$."},"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":"1706.09972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-06-29T22:26:47Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ad2aeecfd0f27c530ffaf73b9c7d05847d4ea92e3cee65eecf9aabb05ab390c9","abstract_canon_sha256":"191ffa1df48c2f31ef642aa739f7b38dc5a24a0742a0d0c39c3c1a8ca037ce11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:11.815898Z","signature_b64":"+AEjaSxLuvARC6MIyJTpihWjFdjwchr30db6GlUolECv35eTkBKXtFfXDcWcruuZPSfnioU7d7sQ1GJySkchDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aed9d9cfd0356c94cd952e68f523c334cc48c88333161cc75636d02a2c9229c2","last_reissued_at":"2026-05-18T00:41:11.815252Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:11.815252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The trivial lower bound for the girth of $S_n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Sean Eberhard","submitted_at":"2017-06-29T22:26:47Z","abstract_excerpt":"Consider the Cayley graph of $S_n$ generated by a random pair of elements $x,y$. Conjecturally, the girth of this graph is $\\Omega(n \\log n)$ with probability tending to $1$ as $n\\to\\infty$. We show that it is at least $\\Omega(n^{1/3})$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09972","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":"1706.09972","created_at":"2026-05-18T00:41:11.815355+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.09972v1","created_at":"2026-05-18T00:41:11.815355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09972","created_at":"2026-05-18T00:41:11.815355+00:00"},{"alias_kind":"pith_short_12","alias_value":"V3M5TT6QGVWJ","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V3M5TT6QGVWJJTMV","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V3M5TT6Q","created_at":"2026-05-18T12:31:49.984773+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/V3M5TT6QGVWJJTMVFZUPKI6DGT","json":"https://pith.science/pith/V3M5TT6QGVWJJTMVFZUPKI6DGT.json","graph_json":"https://pith.science/api/pith-number/V3M5TT6QGVWJJTMVFZUPKI6DGT/graph.json","events_json":"https://pith.science/api/pith-number/V3M5TT6QGVWJJTMVFZUPKI6DGT/events.json","paper":"https://pith.science/paper/V3M5TT6Q"},"agent_actions":{"view_html":"https://pith.science/pith/V3M5TT6QGVWJJTMVFZUPKI6DGT","download_json":"https://pith.science/pith/V3M5TT6QGVWJJTMVFZUPKI6DGT.json","view_paper":"https://pith.science/paper/V3M5TT6Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.09972&json=true","fetch_graph":"https://pith.science/api/pith-number/V3M5TT6QGVWJJTMVFZUPKI6DGT/graph.json","fetch_events":"https://pith.science/api/pith-number/V3M5TT6QGVWJJTMVFZUPKI6DGT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V3M5TT6QGVWJJTMVFZUPKI6DGT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V3M5TT6QGVWJJTMVFZUPKI6DGT/action/storage_attestation","attest_author":"https://pith.science/pith/V3M5TT6QGVWJJTMVFZUPKI6DGT/action/author_attestation","sign_citation":"https://pith.science/pith/V3M5TT6QGVWJJTMVFZUPKI6DGT/action/citation_signature","submit_replication":"https://pith.science/pith/V3M5TT6QGVWJJTMVFZUPKI6DGT/action/replication_record"}},"created_at":"2026-05-18T00:41:11.815355+00:00","updated_at":"2026-05-18T00:41:11.815355+00:00"}