{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:S3Y2MJ7HSOFNQ32FNPCQMM3TRN","short_pith_number":"pith:S3Y2MJ7H","schema_version":"1.0","canonical_sha256":"96f1a627e7938ad86f456bc50633738b6d993e99efb27609c4e49191930912b9","source":{"kind":"arxiv","id":"1303.3776","version":3},"attestation_state":"computed","paper":{"title":"Factorization of permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chi-Kwong Li, Nung-sing Sze, Sharon H. Li, Zejun Huang","submitted_at":"2013-03-15T14:01:22Z","abstract_excerpt":"We consider the problem of factoring permutations as a product of special types of transpositions, namely, those transpositions involving two positions with bounded distances. In particular, we investigate the minimum number, $\\delta$, such that every permutation can be factored into no more than $\\delta$ special transpositions. This study is related to sorting algorithms, Cayley graphs, and genomics."},"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":"1303.3776","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-15T14:01:22Z","cross_cats_sorted":[],"title_canon_sha256":"1d5cff80ba05119de3bf15d035012e53f17eb93ed1c58bc80ec9d0f1971cb8e9","abstract_canon_sha256":"cbeff231cc268470abfedc5d39c21f8d46140a62ef7ecad577335a28d5b35c0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:56:00.133928Z","signature_b64":"7QWQVx8So5v8rbX6O6VFPprMtRF3WZIbc2lSVXftU9VP/3LOogp/FZ/MHwfg8JUq78/kg0HJmUfBtxSR/dC2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96f1a627e7938ad86f456bc50633738b6d993e99efb27609c4e49191930912b9","last_reissued_at":"2026-05-18T01:56:00.132926Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:56:00.132926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Factorization of permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chi-Kwong Li, Nung-sing Sze, Sharon H. Li, Zejun Huang","submitted_at":"2013-03-15T14:01:22Z","abstract_excerpt":"We consider the problem of factoring permutations as a product of special types of transpositions, namely, those transpositions involving two positions with bounded distances. In particular, we investigate the minimum number, $\\delta$, such that every permutation can be factored into no more than $\\delta$ special transpositions. This study is related to sorting algorithms, Cayley graphs, and genomics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3776","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1303.3776","created_at":"2026-05-18T01:56:00.133044+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.3776v3","created_at":"2026-05-18T01:56:00.133044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3776","created_at":"2026-05-18T01:56:00.133044+00:00"},{"alias_kind":"pith_short_12","alias_value":"S3Y2MJ7HSOFN","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"S3Y2MJ7HSOFNQ32F","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"S3Y2MJ7H","created_at":"2026-05-18T12:27:59.945178+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/S3Y2MJ7HSOFNQ32FNPCQMM3TRN","json":"https://pith.science/pith/S3Y2MJ7HSOFNQ32FNPCQMM3TRN.json","graph_json":"https://pith.science/api/pith-number/S3Y2MJ7HSOFNQ32FNPCQMM3TRN/graph.json","events_json":"https://pith.science/api/pith-number/S3Y2MJ7HSOFNQ32FNPCQMM3TRN/events.json","paper":"https://pith.science/paper/S3Y2MJ7H"},"agent_actions":{"view_html":"https://pith.science/pith/S3Y2MJ7HSOFNQ32FNPCQMM3TRN","download_json":"https://pith.science/pith/S3Y2MJ7HSOFNQ32FNPCQMM3TRN.json","view_paper":"https://pith.science/paper/S3Y2MJ7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.3776&json=true","fetch_graph":"https://pith.science/api/pith-number/S3Y2MJ7HSOFNQ32FNPCQMM3TRN/graph.json","fetch_events":"https://pith.science/api/pith-number/S3Y2MJ7HSOFNQ32FNPCQMM3TRN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S3Y2MJ7HSOFNQ32FNPCQMM3TRN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S3Y2MJ7HSOFNQ32FNPCQMM3TRN/action/storage_attestation","attest_author":"https://pith.science/pith/S3Y2MJ7HSOFNQ32FNPCQMM3TRN/action/author_attestation","sign_citation":"https://pith.science/pith/S3Y2MJ7HSOFNQ32FNPCQMM3TRN/action/citation_signature","submit_replication":"https://pith.science/pith/S3Y2MJ7HSOFNQ32FNPCQMM3TRN/action/replication_record"}},"created_at":"2026-05-18T01:56:00.133044+00:00","updated_at":"2026-05-18T01:56:00.133044+00:00"}