{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:FU6POUSTZVIMUGVXMLKFW7VM2V","short_pith_number":"pith:FU6POUST","schema_version":"1.0","canonical_sha256":"2d3cf75253cd50ca1ab762d45b7eacd5461e287e587880832cd0f6d7ac89c116","source":{"kind":"arxiv","id":"0709.4175","version":1},"attestation_state":"computed","paper":{"title":"Fast Fourier Transforms for the Rook Monoid","license":"","headline":"","cross_cats":["math.NA"],"primary_cat":"math.RT","authors_text":"Daniel N. Rockmore, Martin Malandro","submitted_at":"2007-09-26T14:35:13Z","abstract_excerpt":"We define the notion of the Fourier transform for the rook monoid (also called the symmetric inverse semigroup) and provide two efficient divide-and-conquer algorithms (fast Fourier transforms, or FFTs) for computing it. This paper marks the first extension of group FFTs to non-group semigroups."},"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":"0709.4175","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.RT","submitted_at":"2007-09-26T14:35:13Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"c53c58b772beb98d84d85d1f9b28e6d57e6a7744e5a62729bd755cf3161a9377","abstract_canon_sha256":"b7fa8e1977c8cebad5a6b73f061fb801b61115642273aa23039c9bcb8ffc0996"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:32.540077Z","signature_b64":"aYTLNGD9hE9fwuqOSgZjNsmz7+Ybw2XP6wcS7dCD/9mS4jTLIFvIMJdWUvt8+rW84f/goEIS7xgNYIT9Dut7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d3cf75253cd50ca1ab762d45b7eacd5461e287e587880832cd0f6d7ac89c116","last_reissued_at":"2026-05-18T04:16:32.539634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:32.539634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Fourier Transforms for the Rook Monoid","license":"","headline":"","cross_cats":["math.NA"],"primary_cat":"math.RT","authors_text":"Daniel N. Rockmore, Martin Malandro","submitted_at":"2007-09-26T14:35:13Z","abstract_excerpt":"We define the notion of the Fourier transform for the rook monoid (also called the symmetric inverse semigroup) and provide two efficient divide-and-conquer algorithms (fast Fourier transforms, or FFTs) for computing it. This paper marks the first extension of group FFTs to non-group semigroups."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0709.4175","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":"0709.4175","created_at":"2026-05-18T04:16:32.539699+00:00"},{"alias_kind":"arxiv_version","alias_value":"0709.4175v1","created_at":"2026-05-18T04:16:32.539699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0709.4175","created_at":"2026-05-18T04:16:32.539699+00:00"},{"alias_kind":"pith_short_12","alias_value":"FU6POUSTZVIM","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"FU6POUSTZVIMUGVX","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"FU6POUST","created_at":"2026-05-18T12:25:55.427421+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/FU6POUSTZVIMUGVXMLKFW7VM2V","json":"https://pith.science/pith/FU6POUSTZVIMUGVXMLKFW7VM2V.json","graph_json":"https://pith.science/api/pith-number/FU6POUSTZVIMUGVXMLKFW7VM2V/graph.json","events_json":"https://pith.science/api/pith-number/FU6POUSTZVIMUGVXMLKFW7VM2V/events.json","paper":"https://pith.science/paper/FU6POUST"},"agent_actions":{"view_html":"https://pith.science/pith/FU6POUSTZVIMUGVXMLKFW7VM2V","download_json":"https://pith.science/pith/FU6POUSTZVIMUGVXMLKFW7VM2V.json","view_paper":"https://pith.science/paper/FU6POUST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0709.4175&json=true","fetch_graph":"https://pith.science/api/pith-number/FU6POUSTZVIMUGVXMLKFW7VM2V/graph.json","fetch_events":"https://pith.science/api/pith-number/FU6POUSTZVIMUGVXMLKFW7VM2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FU6POUSTZVIMUGVXMLKFW7VM2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FU6POUSTZVIMUGVXMLKFW7VM2V/action/storage_attestation","attest_author":"https://pith.science/pith/FU6POUSTZVIMUGVXMLKFW7VM2V/action/author_attestation","sign_citation":"https://pith.science/pith/FU6POUSTZVIMUGVXMLKFW7VM2V/action/citation_signature","submit_replication":"https://pith.science/pith/FU6POUSTZVIMUGVXMLKFW7VM2V/action/replication_record"}},"created_at":"2026-05-18T04:16:32.539699+00:00","updated_at":"2026-05-18T04:16:32.539699+00:00"}