{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:NYIJ643NBZCCNEYHQCI2ZP7JOV","short_pith_number":"pith:NYIJ643N","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"},"canonical_sha256":"6e109f736d0e442693078091acbfe9755899e89af5573df695d5eed01a262ff6","source":{"kind":"arxiv","id":"0809.3476","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0809.3476","created_at":"2026-05-18T04:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"0809.3476v2","created_at":"2026-05-18T04:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.3476","created_at":"2026-05-18T04:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"NYIJ643NBZCC","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"NYIJ643NBZCCNEYH","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"NYIJ643N","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:NYIJ643NBZCCNEYHQCI2ZP7JOV","target":"record","payload":{"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"},"canonical_sha256":"6e109f736d0e442693078091acbfe9755899e89af5573df695d5eed01a262ff6","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"},"source_kind":"arxiv","source_id":"0809.3476","source_version":2,"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-05-18T04:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lacqc0iTydxedp8kjviVkDLK8nEK+2dnIIWof/8GM8ya7WCG1n2l3jkt4H0A6U1WXkLaaDHGbSYzbckyjWO/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:39:38.060382Z"},"content_sha256":"6ac375772f90d98557fc5dad9e8b00a8f3e51227697750bdc926bb3fa1ba1a41","schema_version":"1.0","event_id":"sha256:6ac375772f90d98557fc5dad9e8b00a8f3e51227697750bdc926bb3fa1ba1a41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:NYIJ643NBZCCNEYHQCI2ZP7JOV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GobZLQ6PwS9orHfXIbuYq1gPCLcMQwsaiAEf4Ftt+1a/0dCwDs8gX53fCALbxWJ3et4+1qGIuBMcOoleqCRhDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:39:38.060971Z"},"content_sha256":"51519b76777fb212b93563dbe37d7368e1a530f745098037663b628315de8acc","schema_version":"1.0","event_id":"sha256:51519b76777fb212b93563dbe37d7368e1a530f745098037663b628315de8acc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NYIJ643NBZCCNEYHQCI2ZP7JOV/bundle.json","state_url":"https://pith.science/pith/NYIJ643NBZCCNEYHQCI2ZP7JOV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NYIJ643NBZCCNEYHQCI2ZP7JOV/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-09T00:39:38Z","links":{"resolver":"https://pith.science/pith/NYIJ643NBZCCNEYHQCI2ZP7JOV","bundle":"https://pith.science/pith/NYIJ643NBZCCNEYHQCI2ZP7JOV/bundle.json","state":"https://pith.science/pith/NYIJ643NBZCCNEYHQCI2ZP7JOV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NYIJ643NBZCCNEYHQCI2ZP7JOV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:NYIJ643NBZCCNEYHQCI2ZP7JOV","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":"47db31efc4da0b605b23412466420af07d5e4fba3ef3cf4819a24fd665ef57ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-09-20T00:40:45Z","title_canon_sha256":"676816b409e5d8b0e86bbfd59f5e523a1d866db2a559fa2b3df7e1ea0c84a47d"},"schema_version":"1.0","source":{"id":"0809.3476","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0809.3476","created_at":"2026-05-18T04:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"0809.3476v2","created_at":"2026-05-18T04:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.3476","created_at":"2026-05-18T04:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"NYIJ643NBZCC","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"NYIJ643NBZCCNEYH","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"NYIJ643N","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:51519b76777fb212b93563dbe37d7368e1a530f745098037663b628315de8acc","target":"graph","created_at":"2026-05-18T04:33:36Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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).","authors_text":"G. Berkolaiko, J.M. Harrison, M. Novaes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-09-20T00:40:45Z","title":"On inequivalent factorizations of a cycle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.3476","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6ac375772f90d98557fc5dad9e8b00a8f3e51227697750bdc926bb3fa1ba1a41","target":"record","created_at":"2026-05-18T04:33:36Z","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":"47db31efc4da0b605b23412466420af07d5e4fba3ef3cf4819a24fd665ef57ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-09-20T00:40:45Z","title_canon_sha256":"676816b409e5d8b0e86bbfd59f5e523a1d866db2a559fa2b3df7e1ea0c84a47d"},"schema_version":"1.0","source":{"id":"0809.3476","kind":"arxiv","version":2}},"canonical_sha256":"6e109f736d0e442693078091acbfe9755899e89af5573df695d5eed01a262ff6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e109f736d0e442693078091acbfe9755899e89af5573df695d5eed01a262ff6","first_computed_at":"2026-05-18T04:33:36.705817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:33:36.705817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iSLb8wVMAQBVrUn/LAcHLGYuYtvfRmBwShmV3aHnpT6naAe0oFwAFbFuQgBfBhZyghXoEf5lwi6qEq+eJRQ9BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:33:36.706386Z","signed_message":"canonical_sha256_bytes"},"source_id":"0809.3476","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ac375772f90d98557fc5dad9e8b00a8f3e51227697750bdc926bb3fa1ba1a41","sha256:51519b76777fb212b93563dbe37d7368e1a530f745098037663b628315de8acc"],"state_sha256":"b382bac5d36a1a7faa35f88e94931eb04714dde851914b36890419a8ffcba8da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F2zdqGRcZw8AF4hNoH8dimekAM8ZERWtE9Dd4Ckip94nYecCVZigcR3eCc3m8oYySvrCDFDJ2kjQ/819GHYVAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:39:38.063630Z","bundle_sha256":"366c5bf03a061c702c3cc788e8f17eff18dedbf14b0ffb92a56876761697b2fe"}}