{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:NYIJ643NBZCCNEYHQCI2ZP7JOV","short_pith_number":"pith:NYIJ643N","schema_version":"1.0","canonical_sha256":"6e109f736d0e442693078091acbfe9755899e89af5573df695d5eed01a262ff6","source":{"kind":"arxiv","id":"0809.3476","version":2},"attestation_state":"computed","paper":{"title":"On inequivalent factorizations of a cycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"G. Berkolaiko, J.M. Harrison, M. Novaes","submitted_at":"2008-09-20T00:40:45Z","abstract_excerpt":"We introduce a bijection between inequivalent minimal factorizations of the n-cycle (1 2 ... n) into a product of smaller cycles of given length, on one side, and trees of a certain structure on the other. We use this bijection to count the factorizations with a given number of different commuting factors that can appear in the first and in the last positions, a problem which has found applications in physics. We also provide a necessary and sufficient condition for a set of cycles to be arrangeable into a product evaluating to (1 2 ... n)."},"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":"0809.3476","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-09-20T00:40:45Z","cross_cats_sorted":[],"title_canon_sha256":"676816b409e5d8b0e86bbfd59f5e523a1d866db2a559fa2b3df7e1ea0c84a47d","abstract_canon_sha256":"47db31efc4da0b605b23412466420af07d5e4fba3ef3cf4819a24fd665ef57ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:36.706386Z","signature_b64":"iSLb8wVMAQBVrUn/LAcHLGYuYtvfRmBwShmV3aHnpT6naAe0oFwAFbFuQgBfBhZyghXoEf5lwi6qEq+eJRQ9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e109f736d0e442693078091acbfe9755899e89af5573df695d5eed01a262ff6","last_reissued_at":"2026-05-18T04:33:36.705817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:36.705817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On inequivalent factorizations of a cycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"G. Berkolaiko, J.M. Harrison, M. Novaes","submitted_at":"2008-09-20T00:40:45Z","abstract_excerpt":"We introduce a bijection between inequivalent minimal factorizations of the n-cycle (1 2 ... n) into a product of smaller cycles of given length, on one side, and trees of a certain structure on the other. We use this bijection to count the factorizations with a given number of different commuting factors that can appear in the first and in the last positions, a problem which has found applications in physics. We also provide a necessary and sufficient condition for a set of cycles to be arrangeable into a product evaluating to (1 2 ... n)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.3476","kind":"arxiv","version":2},"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":"0809.3476","created_at":"2026-05-18T04:33:36.705909+00:00"},{"alias_kind":"arxiv_version","alias_value":"0809.3476v2","created_at":"2026-05-18T04:33:36.705909+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.3476","created_at":"2026-05-18T04:33:36.705909+00:00"},{"alias_kind":"pith_short_12","alias_value":"NYIJ643NBZCC","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"NYIJ643NBZCCNEYH","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"NYIJ643N","created_at":"2026-05-18T12:25:57.157939+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/NYIJ643NBZCCNEYHQCI2ZP7JOV","json":"https://pith.science/pith/NYIJ643NBZCCNEYHQCI2ZP7JOV.json","graph_json":"https://pith.science/api/pith-number/NYIJ643NBZCCNEYHQCI2ZP7JOV/graph.json","events_json":"https://pith.science/api/pith-number/NYIJ643NBZCCNEYHQCI2ZP7JOV/events.json","paper":"https://pith.science/paper/NYIJ643N"},"agent_actions":{"view_html":"https://pith.science/pith/NYIJ643NBZCCNEYHQCI2ZP7JOV","download_json":"https://pith.science/pith/NYIJ643NBZCCNEYHQCI2ZP7JOV.json","view_paper":"https://pith.science/paper/NYIJ643N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0809.3476&json=true","fetch_graph":"https://pith.science/api/pith-number/NYIJ643NBZCCNEYHQCI2ZP7JOV/graph.json","fetch_events":"https://pith.science/api/pith-number/NYIJ643NBZCCNEYHQCI2ZP7JOV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NYIJ643NBZCCNEYHQCI2ZP7JOV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NYIJ643NBZCCNEYHQCI2ZP7JOV/action/storage_attestation","attest_author":"https://pith.science/pith/NYIJ643NBZCCNEYHQCI2ZP7JOV/action/author_attestation","sign_citation":"https://pith.science/pith/NYIJ643NBZCCNEYHQCI2ZP7JOV/action/citation_signature","submit_replication":"https://pith.science/pith/NYIJ643NBZCCNEYHQCI2ZP7JOV/action/replication_record"}},"created_at":"2026-05-18T04:33:36.705909+00:00","updated_at":"2026-05-18T04:33:36.705909+00:00"}