{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DY5KE6UCMX7FVG5FT5WLLVLGQR","short_pith_number":"pith:DY5KE6UC","schema_version":"1.0","canonical_sha256":"1e3aa27a8265fe5a9ba59f6cb5d566847ef0ab082d785ddcaef7eec20d20232e","source":{"kind":"arxiv","id":"1903.10701","version":1},"attestation_state":"computed","paper":{"title":"Syntactic View of Sigma-Tau Generation of Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Wiktor Zuba, Wojciech Rytter","submitted_at":"2019-03-26T06:31:35Z","abstract_excerpt":"We give a syntactic view of the Sawada-Williams $(\\sigma,\\tau)$-generation of permutations. The corresponding sequence of $\\sigma-\\tau$-operations, of length $n!-1$ is shown to be highly compressible: it has $O(n^2\\log n)$ bit description. Using this compact description we design fast algorithms for ranking and unranking permutations."},"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":"1903.10701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-26T06:31:35Z","cross_cats_sorted":[],"title_canon_sha256":"90dec5122cb1c70d267f31de5c8d3498710fb2a549e80a09e53c3a1c98ba8776","abstract_canon_sha256":"518580db76d2f2bb15018d5a144f88dcfda5b4439443cd95b8fd56c9e52ddcfc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:17.995723Z","signature_b64":"LT4moujZIHjWRW+E40TaaflFrK/PgiGX00ID4ou/0w7p+Vduo7UHMv+uSnd6zA3hI9z1zE/h8W9LGem4AMCuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e3aa27a8265fe5a9ba59f6cb5d566847ef0ab082d785ddcaef7eec20d20232e","last_reissued_at":"2026-05-17T23:50:17.995121Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:17.995121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Syntactic View of Sigma-Tau Generation of Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Wiktor Zuba, Wojciech Rytter","submitted_at":"2019-03-26T06:31:35Z","abstract_excerpt":"We give a syntactic view of the Sawada-Williams $(\\sigma,\\tau)$-generation of permutations. The corresponding sequence of $\\sigma-\\tau$-operations, of length $n!-1$ is shown to be highly compressible: it has $O(n^2\\log n)$ bit description. Using this compact description we design fast algorithms for ranking and unranking permutations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10701","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":"1903.10701","created_at":"2026-05-17T23:50:17.995201+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.10701v1","created_at":"2026-05-17T23:50:17.995201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10701","created_at":"2026-05-17T23:50:17.995201+00:00"},{"alias_kind":"pith_short_12","alias_value":"DY5KE6UCMX7F","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"DY5KE6UCMX7FVG5F","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"DY5KE6UC","created_at":"2026-05-18T12:33:15.570797+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/DY5KE6UCMX7FVG5FT5WLLVLGQR","json":"https://pith.science/pith/DY5KE6UCMX7FVG5FT5WLLVLGQR.json","graph_json":"https://pith.science/api/pith-number/DY5KE6UCMX7FVG5FT5WLLVLGQR/graph.json","events_json":"https://pith.science/api/pith-number/DY5KE6UCMX7FVG5FT5WLLVLGQR/events.json","paper":"https://pith.science/paper/DY5KE6UC"},"agent_actions":{"view_html":"https://pith.science/pith/DY5KE6UCMX7FVG5FT5WLLVLGQR","download_json":"https://pith.science/pith/DY5KE6UCMX7FVG5FT5WLLVLGQR.json","view_paper":"https://pith.science/paper/DY5KE6UC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.10701&json=true","fetch_graph":"https://pith.science/api/pith-number/DY5KE6UCMX7FVG5FT5WLLVLGQR/graph.json","fetch_events":"https://pith.science/api/pith-number/DY5KE6UCMX7FVG5FT5WLLVLGQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DY5KE6UCMX7FVG5FT5WLLVLGQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DY5KE6UCMX7FVG5FT5WLLVLGQR/action/storage_attestation","attest_author":"https://pith.science/pith/DY5KE6UCMX7FVG5FT5WLLVLGQR/action/author_attestation","sign_citation":"https://pith.science/pith/DY5KE6UCMX7FVG5FT5WLLVLGQR/action/citation_signature","submit_replication":"https://pith.science/pith/DY5KE6UCMX7FVG5FT5WLLVLGQR/action/replication_record"}},"created_at":"2026-05-17T23:50:17.995201+00:00","updated_at":"2026-05-17T23:50:17.995201+00:00"}