{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UNG5NPJV2YBBF5XPBUYEKYWDGH","short_pith_number":"pith:UNG5NPJV","schema_version":"1.0","canonical_sha256":"a34dd6bd35d60212f6ef0d304562c331fa2544d1037fd7dd78eef6f8aa2294db","source":{"kind":"arxiv","id":"1601.00319","version":6},"attestation_state":"computed","paper":{"title":"On the cycle structure of the product of random maximal cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boris Pittel, Miklos Bona","submitted_at":"2016-01-03T18:19:53Z","abstract_excerpt":"The subject of this paper is the cycle structure of the random permutation $\\sigma$ of $[N]$, which is the product of $k$ independent random cycles of maximal length $N$. We use the character-based Fourier transform to study the number of cycles of $\\sigma$ and also the distribution of the elements of the subset $[\\ell]$ among the cycles of $\\sigma$."},"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":"1601.00319","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-03T18:19:53Z","cross_cats_sorted":[],"title_canon_sha256":"5025b0097db34ca3f89db6166ff2079b4a7cfcfb243be31ccd63d66a1b15c768","abstract_canon_sha256":"5507fcda33604f378315cb68d64432c3868e2449f596267d610aed6d28612b86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:30.901122Z","signature_b64":"Y1PSnG25CMFwkXG8/os7DwZqQVmcAKz4kjL4Shxe0ySFrpmoma2y1Y/Iaq9/6mcyMoU7ud08XTiMb+Xxk4LTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a34dd6bd35d60212f6ef0d304562c331fa2544d1037fd7dd78eef6f8aa2294db","last_reissued_at":"2026-05-18T01:02:30.900578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:30.900578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the cycle structure of the product of random maximal cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boris Pittel, Miklos Bona","submitted_at":"2016-01-03T18:19:53Z","abstract_excerpt":"The subject of this paper is the cycle structure of the random permutation $\\sigma$ of $[N]$, which is the product of $k$ independent random cycles of maximal length $N$. We use the character-based Fourier transform to study the number of cycles of $\\sigma$ and also the distribution of the elements of the subset $[\\ell]$ among the cycles of $\\sigma$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00319","kind":"arxiv","version":6},"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":"1601.00319","created_at":"2026-05-18T01:02:30.900656+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.00319v6","created_at":"2026-05-18T01:02:30.900656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00319","created_at":"2026-05-18T01:02:30.900656+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNG5NPJV2YBB","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNG5NPJV2YBBF5XP","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNG5NPJV","created_at":"2026-05-18T12:30:46.583412+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/UNG5NPJV2YBBF5XPBUYEKYWDGH","json":"https://pith.science/pith/UNG5NPJV2YBBF5XPBUYEKYWDGH.json","graph_json":"https://pith.science/api/pith-number/UNG5NPJV2YBBF5XPBUYEKYWDGH/graph.json","events_json":"https://pith.science/api/pith-number/UNG5NPJV2YBBF5XPBUYEKYWDGH/events.json","paper":"https://pith.science/paper/UNG5NPJV"},"agent_actions":{"view_html":"https://pith.science/pith/UNG5NPJV2YBBF5XPBUYEKYWDGH","download_json":"https://pith.science/pith/UNG5NPJV2YBBF5XPBUYEKYWDGH.json","view_paper":"https://pith.science/paper/UNG5NPJV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.00319&json=true","fetch_graph":"https://pith.science/api/pith-number/UNG5NPJV2YBBF5XPBUYEKYWDGH/graph.json","fetch_events":"https://pith.science/api/pith-number/UNG5NPJV2YBBF5XPBUYEKYWDGH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNG5NPJV2YBBF5XPBUYEKYWDGH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNG5NPJV2YBBF5XPBUYEKYWDGH/action/storage_attestation","attest_author":"https://pith.science/pith/UNG5NPJV2YBBF5XPBUYEKYWDGH/action/author_attestation","sign_citation":"https://pith.science/pith/UNG5NPJV2YBBF5XPBUYEKYWDGH/action/citation_signature","submit_replication":"https://pith.science/pith/UNG5NPJV2YBBF5XPBUYEKYWDGH/action/replication_record"}},"created_at":"2026-05-18T01:02:30.900656+00:00","updated_at":"2026-05-18T01:02:30.900656+00:00"}