{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:HQLTGEXBV6PHYUO4ZKB4O3J7WT","short_pith_number":"pith:HQLTGEXB","canonical_record":{"source":{"id":"1008.3677","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-22T06:36:30Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"93658617e577b58fef741e48c953ec7f9177b4ab1db8beb8dd96b3064a78291d","abstract_canon_sha256":"f51e7f5038f9e13ba84292e7da5ba20eee1efa0dd12aa5ba3c549541fe6d077b"},"schema_version":"1.0"},"canonical_sha256":"3c173312e1af9e7c51dcca83c76d3fb4cbec744b8294f7ac4852a23a952b13f9","source":{"kind":"arxiv","id":"1008.3677","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3677","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3677v3","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3677","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"HQLTGEXBV6PH","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HQLTGEXBV6PHYUO4","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HQLTGEXB","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:HQLTGEXBV6PHYUO4ZKB4O3J7WT","target":"record","payload":{"canonical_record":{"source":{"id":"1008.3677","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-22T06:36:30Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"93658617e577b58fef741e48c953ec7f9177b4ab1db8beb8dd96b3064a78291d","abstract_canon_sha256":"f51e7f5038f9e13ba84292e7da5ba20eee1efa0dd12aa5ba3c549541fe6d077b"},"schema_version":"1.0"},"canonical_sha256":"3c173312e1af9e7c51dcca83c76d3fb4cbec744b8294f7ac4852a23a952b13f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:45.192413Z","signature_b64":"aC/REJAiwxKrdbxlROn/5lQo7nj2OXU8d9Pr8bCjLu/UsiVJ7v5/O3S5d/rAA7xgz5apRyRZzsbgWesTxUjqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c173312e1af9e7c51dcca83c76d3fb4cbec744b8294f7ac4852a23a952b13f9","last_reissued_at":"2026-05-18T03:05:45.191840Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:45.191840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.3677","source_version":3,"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-18T03:05:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6VVy0/OnKinypbtYp1BKsB60q5qy2FV4lOwgrirNHxs5OHzV8td/MlGpyLsZURQ7x8oHQ2fNbzP0OkSMbcGoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:12:22.308556Z"},"content_sha256":"e0a5c1fe450d8f8c295a2957fe3d404a5f7e2dc4ae1c09718ca7455b2d0f5a11","schema_version":"1.0","event_id":"sha256:e0a5c1fe450d8f8c295a2957fe3d404a5f7e2dc4ae1c09718ca7455b2d0f5a11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:HQLTGEXBV6PHYUO4ZKB4O3J7WT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Factorizations of cycles and multi-noded rooted trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.CO","authors_text":"Fu Liu, Rosena R. X. Du","submitted_at":"2010-08-22T06:36:30Z","abstract_excerpt":"In this paper, we study factorizations of cycles. The main result is that under certain condition, the number of ways to factor a $d$-cycle into a product of cycles of prescribed lengths is $d^{r-2}.$ To prove our result, we first define a new class of combinatorial objects, multi-noded rooted trees, which generalize rooted trees. We find the cardinality of this new class which with proper parameters is exactly $d^{r-2}.$ The main part of this paper is the proof that there is a bijection from factorizations of a $d$-cycle to multi-noded rooted trees via factorization graphs. This implies the d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3677","kind":"arxiv","version":3},"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-18T03:05:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4BR+FMfKUsu64zMFwFU5YSSTqusp2op4aO9ohNzj7onT7CvNIIx6Dg8xupcgxIzySyu8QUCSlOsjPoeGVQX2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:12:22.308909Z"},"content_sha256":"0ca0c0cc4065e75c5679f62c216211e6ed72913ae2d8774f89fb96d32f10a03f","schema_version":"1.0","event_id":"sha256:0ca0c0cc4065e75c5679f62c216211e6ed72913ae2d8774f89fb96d32f10a03f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HQLTGEXBV6PHYUO4ZKB4O3J7WT/bundle.json","state_url":"https://pith.science/pith/HQLTGEXBV6PHYUO4ZKB4O3J7WT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HQLTGEXBV6PHYUO4ZKB4O3J7WT/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-03T08:12:22Z","links":{"resolver":"https://pith.science/pith/HQLTGEXBV6PHYUO4ZKB4O3J7WT","bundle":"https://pith.science/pith/HQLTGEXBV6PHYUO4ZKB4O3J7WT/bundle.json","state":"https://pith.science/pith/HQLTGEXBV6PHYUO4ZKB4O3J7WT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HQLTGEXBV6PHYUO4ZKB4O3J7WT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:HQLTGEXBV6PHYUO4ZKB4O3J7WT","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":"f51e7f5038f9e13ba84292e7da5ba20eee1efa0dd12aa5ba3c549541fe6d077b","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-22T06:36:30Z","title_canon_sha256":"93658617e577b58fef741e48c953ec7f9177b4ab1db8beb8dd96b3064a78291d"},"schema_version":"1.0","source":{"id":"1008.3677","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3677","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3677v3","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3677","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"HQLTGEXBV6PH","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HQLTGEXBV6PHYUO4","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HQLTGEXB","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:0ca0c0cc4065e75c5679f62c216211e6ed72913ae2d8774f89fb96d32f10a03f","target":"graph","created_at":"2026-05-18T03:05:45Z","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":"In this paper, we study factorizations of cycles. The main result is that under certain condition, the number of ways to factor a $d$-cycle into a product of cycles of prescribed lengths is $d^{r-2}.$ To prove our result, we first define a new class of combinatorial objects, multi-noded rooted trees, which generalize rooted trees. We find the cardinality of this new class which with proper parameters is exactly $d^{r-2}.$ The main part of this paper is the proof that there is a bijection from factorizations of a $d$-cycle to multi-noded rooted trees via factorization graphs. This implies the d","authors_text":"Fu Liu, Rosena R. X. Du","cross_cats":["math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-22T06:36:30Z","title":"Factorizations of cycles and multi-noded rooted trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3677","kind":"arxiv","version":3},"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:e0a5c1fe450d8f8c295a2957fe3d404a5f7e2dc4ae1c09718ca7455b2d0f5a11","target":"record","created_at":"2026-05-18T03:05:45Z","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":"f51e7f5038f9e13ba84292e7da5ba20eee1efa0dd12aa5ba3c549541fe6d077b","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-22T06:36:30Z","title_canon_sha256":"93658617e577b58fef741e48c953ec7f9177b4ab1db8beb8dd96b3064a78291d"},"schema_version":"1.0","source":{"id":"1008.3677","kind":"arxiv","version":3}},"canonical_sha256":"3c173312e1af9e7c51dcca83c76d3fb4cbec744b8294f7ac4852a23a952b13f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c173312e1af9e7c51dcca83c76d3fb4cbec744b8294f7ac4852a23a952b13f9","first_computed_at":"2026-05-18T03:05:45.191840Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:45.191840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aC/REJAiwxKrdbxlROn/5lQo7nj2OXU8d9Pr8bCjLu/UsiVJ7v5/O3S5d/rAA7xgz5apRyRZzsbgWesTxUjqBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:45.192413Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.3677","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0a5c1fe450d8f8c295a2957fe3d404a5f7e2dc4ae1c09718ca7455b2d0f5a11","sha256:0ca0c0cc4065e75c5679f62c216211e6ed72913ae2d8774f89fb96d32f10a03f"],"state_sha256":"b9b8bc1c6eea628a3e8fdd96f8306f8f11e8d081ba3ce5a7892efe7b5702833d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/zOdwf+ZW8tHwfdwnKSTeSRYQtRLAOBs/3W3bCyuss8mxo4YeZSPVlJwJU9wJt/rd7xyTBkfG2YCikqC5cZGDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T08:12:22.310760Z","bundle_sha256":"1b2949c0ba70c4fbfab0c83878b5169ea7c4ec8a8d6d18b3a131e83dd4d2c683"}}