{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2001:G52UM7CHSFNSUM4IFKINIXFPVM","short_pith_number":"pith:G52UM7CH","schema_version":"1.0","canonical_sha256":"3775467c47915b2a33882a90d45cafab2161dc49d6fa565cdd0b712978b85263","source":{"kind":"arxiv","id":"math/0106039","version":1},"attestation_state":"computed","paper":{"title":"Tree-like properties of cycle factorizations","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Yong, Ian Goulden","submitted_at":"2001-06-06T16:46:37Z","abstract_excerpt":"We provide a bijection between the set of factorizations, that is, ordered (n-1)-tuples of transpositions in ${\\mathcal S}_{n}$ whose product is (12...n), and labelled trees on $n$ vertices. We prove a refinement of a theorem of D\\'{e}nes that establishes new tree-like properties of factorizations. In particular, we show that a certain class of transpositions of a factorization correspond naturally under our bijection to leaf edges of a tree. Moreover, we give a generalization of this fact."},"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":"math/0106039","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2001-06-06T16:46:37Z","cross_cats_sorted":[],"title_canon_sha256":"4b23e958273aa87ee3ab21f445b74cdf614360b5e8a666acc63d92d3ed2ffe8d","abstract_canon_sha256":"284e56cb637a820783dbe0583a5fc924209610e11333825ef4a259611f7022a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:37.730821Z","signature_b64":"iAJI2Elc50Lv1V6KBAz9hvrOlRef4zWCSi1vW2r0iLpVRQHaTLePycWlmxRW/mbzUbbiuRLfavTJ4tiusIFHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3775467c47915b2a33882a90d45cafab2161dc49d6fa565cdd0b712978b85263","last_reissued_at":"2026-05-18T01:05:37.729787Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:37.729787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree-like properties of cycle factorizations","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Yong, Ian Goulden","submitted_at":"2001-06-06T16:46:37Z","abstract_excerpt":"We provide a bijection between the set of factorizations, that is, ordered (n-1)-tuples of transpositions in ${\\mathcal S}_{n}$ whose product is (12...n), and labelled trees on $n$ vertices. We prove a refinement of a theorem of D\\'{e}nes that establishes new tree-like properties of factorizations. In particular, we show that a certain class of transpositions of a factorization correspond naturally under our bijection to leaf edges of a tree. Moreover, we give a generalization of this fact."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0106039","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":"math/0106039","created_at":"2026-05-18T01:05:37.729855+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0106039v1","created_at":"2026-05-18T01:05:37.729855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0106039","created_at":"2026-05-18T01:05:37.729855+00:00"},{"alias_kind":"pith_short_12","alias_value":"G52UM7CHSFNS","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_16","alias_value":"G52UM7CHSFNSUM4I","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_8","alias_value":"G52UM7CH","created_at":"2026-05-18T12:25:50.254431+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/G52UM7CHSFNSUM4IFKINIXFPVM","json":"https://pith.science/pith/G52UM7CHSFNSUM4IFKINIXFPVM.json","graph_json":"https://pith.science/api/pith-number/G52UM7CHSFNSUM4IFKINIXFPVM/graph.json","events_json":"https://pith.science/api/pith-number/G52UM7CHSFNSUM4IFKINIXFPVM/events.json","paper":"https://pith.science/paper/G52UM7CH"},"agent_actions":{"view_html":"https://pith.science/pith/G52UM7CHSFNSUM4IFKINIXFPVM","download_json":"https://pith.science/pith/G52UM7CHSFNSUM4IFKINIXFPVM.json","view_paper":"https://pith.science/paper/G52UM7CH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0106039&json=true","fetch_graph":"https://pith.science/api/pith-number/G52UM7CHSFNSUM4IFKINIXFPVM/graph.json","fetch_events":"https://pith.science/api/pith-number/G52UM7CHSFNSUM4IFKINIXFPVM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G52UM7CHSFNSUM4IFKINIXFPVM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G52UM7CHSFNSUM4IFKINIXFPVM/action/storage_attestation","attest_author":"https://pith.science/pith/G52UM7CHSFNSUM4IFKINIXFPVM/action/author_attestation","sign_citation":"https://pith.science/pith/G52UM7CHSFNSUM4IFKINIXFPVM/action/citation_signature","submit_replication":"https://pith.science/pith/G52UM7CHSFNSUM4IFKINIXFPVM/action/replication_record"}},"created_at":"2026-05-18T01:05:37.729855+00:00","updated_at":"2026-05-18T01:05:37.729855+00:00"}