{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:REMANKXHU5JBTJNTLSC45AJKXO","short_pith_number":"pith:REMANKXH","canonical_record":{"source":{"id":"1108.1983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-09T17:01:12Z","cross_cats_sorted":[],"title_canon_sha256":"044f9b7512739148af0a4cc7a4ecf4406cb0c39c08ab5a65e3e156f6a4bfc884","abstract_canon_sha256":"7e3a3e7193c6072248dae58489c696e98e15465cb90c91b288015a0e4d0ee392"},"schema_version":"1.0"},"canonical_sha256":"891806aae7a75219a5b35c85ce812abb85c2fb472ec01985a1594d8f2f7e6a33","source":{"kind":"arxiv","id":"1108.1983","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1983","created_at":"2026-05-18T04:15:50Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1983v1","created_at":"2026-05-18T04:15:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1983","created_at":"2026-05-18T04:15:50Z"},{"alias_kind":"pith_short_12","alias_value":"REMANKXHU5JB","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"REMANKXHU5JBTJNT","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"REMANKXH","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:REMANKXHU5JBTJNTLSC45AJKXO","target":"record","payload":{"canonical_record":{"source":{"id":"1108.1983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-09T17:01:12Z","cross_cats_sorted":[],"title_canon_sha256":"044f9b7512739148af0a4cc7a4ecf4406cb0c39c08ab5a65e3e156f6a4bfc884","abstract_canon_sha256":"7e3a3e7193c6072248dae58489c696e98e15465cb90c91b288015a0e4d0ee392"},"schema_version":"1.0"},"canonical_sha256":"891806aae7a75219a5b35c85ce812abb85c2fb472ec01985a1594d8f2f7e6a33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:50.758496Z","signature_b64":"eCIKxouyfzYskqCJDCl4Ol/PIMUdeIz47mwc35DX1Qt435/5S3mzvPCC8BhQUR1oRQgWhXgBEjujm7lijZVrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"891806aae7a75219a5b35c85ce812abb85c2fb472ec01985a1594d8f2f7e6a33","last_reissued_at":"2026-05-18T04:15:50.757905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:50.757905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.1983","source_version":1,"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:15:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UCUcJAtdl3cLENDLeHkcOVExTdrs7ECxPLzdL1fUWkPdHSZzInudOxGwjXyTwBmQvo6Wy5mrB3uwvnhJeprnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T14:03:54.202788Z"},"content_sha256":"ff23c6f424271b89e72d592be1c9a2d64e7680104718b1f87631e3586a01ec94","schema_version":"1.0","event_id":"sha256:ff23c6f424271b89e72d592be1c9a2d64e7680104718b1f87631e3586a01ec94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:REMANKXHU5JBTJNTLSC45AJKXO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Succinct Representations of Permutations and Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"J. Ian Munro, Rajeev Raman, S. Srinivasa Rao, Venkatesh Raman","submitted_at":"2011-08-09T17:01:12Z","abstract_excerpt":"We investigate the problem of succinctly representing an arbitrary permutation, \\pi, on {0,...,n-1} so that \\pi^k(i) can be computed quickly for any i and any (positive or negative) integer power k. A representation taking (1+\\epsilon) n lg n + O(1) bits suffices to compute arbitrary powers in constant time, for any positive constant \\epsilon <= 1. A representation taking the optimal \\ceil{\\lg n!} + o(n) bits can be used to compute arbitrary powers in O(lg n / lg lg n) time.\n  We then consider the more general problem of succinctly representing an arbitrary function, f: [n] \\rightarrow [n] so "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1983","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"},"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:15:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LQiHh9gPqeQbcQJ8qnNNUkClOXZIJ0VRTdRjmbNAm52IwprK2VvYMdfGLrzY0F5uGr3PDe6M0RB9sKIAwNSSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T14:03:54.203463Z"},"content_sha256":"e3fe99a227ef51e99de6a15b4befd66f34ed395dcf5b48d3f2f51b6b12d0de12","schema_version":"1.0","event_id":"sha256:e3fe99a227ef51e99de6a15b4befd66f34ed395dcf5b48d3f2f51b6b12d0de12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/REMANKXHU5JBTJNTLSC45AJKXO/bundle.json","state_url":"https://pith.science/pith/REMANKXHU5JBTJNTLSC45AJKXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/REMANKXHU5JBTJNTLSC45AJKXO/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-05-22T14:03:54Z","links":{"resolver":"https://pith.science/pith/REMANKXHU5JBTJNTLSC45AJKXO","bundle":"https://pith.science/pith/REMANKXHU5JBTJNTLSC45AJKXO/bundle.json","state":"https://pith.science/pith/REMANKXHU5JBTJNTLSC45AJKXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/REMANKXHU5JBTJNTLSC45AJKXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:REMANKXHU5JBTJNTLSC45AJKXO","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":"7e3a3e7193c6072248dae58489c696e98e15465cb90c91b288015a0e4d0ee392","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-09T17:01:12Z","title_canon_sha256":"044f9b7512739148af0a4cc7a4ecf4406cb0c39c08ab5a65e3e156f6a4bfc884"},"schema_version":"1.0","source":{"id":"1108.1983","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1983","created_at":"2026-05-18T04:15:50Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1983v1","created_at":"2026-05-18T04:15:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1983","created_at":"2026-05-18T04:15:50Z"},{"alias_kind":"pith_short_12","alias_value":"REMANKXHU5JB","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"REMANKXHU5JBTJNT","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"REMANKXH","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:e3fe99a227ef51e99de6a15b4befd66f34ed395dcf5b48d3f2f51b6b12d0de12","target":"graph","created_at":"2026-05-18T04:15:50Z","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 investigate the problem of succinctly representing an arbitrary permutation, \\pi, on {0,...,n-1} so that \\pi^k(i) can be computed quickly for any i and any (positive or negative) integer power k. A representation taking (1+\\epsilon) n lg n + O(1) bits suffices to compute arbitrary powers in constant time, for any positive constant \\epsilon <= 1. A representation taking the optimal \\ceil{\\lg n!} + o(n) bits can be used to compute arbitrary powers in O(lg n / lg lg n) time.\n  We then consider the more general problem of succinctly representing an arbitrary function, f: [n] \\rightarrow [n] so ","authors_text":"J. Ian Munro, Rajeev Raman, S. Srinivasa Rao, Venkatesh Raman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-09T17:01:12Z","title":"Succinct Representations of Permutations and Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1983","kind":"arxiv","version":1},"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:ff23c6f424271b89e72d592be1c9a2d64e7680104718b1f87631e3586a01ec94","target":"record","created_at":"2026-05-18T04:15:50Z","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":"7e3a3e7193c6072248dae58489c696e98e15465cb90c91b288015a0e4d0ee392","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-09T17:01:12Z","title_canon_sha256":"044f9b7512739148af0a4cc7a4ecf4406cb0c39c08ab5a65e3e156f6a4bfc884"},"schema_version":"1.0","source":{"id":"1108.1983","kind":"arxiv","version":1}},"canonical_sha256":"891806aae7a75219a5b35c85ce812abb85c2fb472ec01985a1594d8f2f7e6a33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"891806aae7a75219a5b35c85ce812abb85c2fb472ec01985a1594d8f2f7e6a33","first_computed_at":"2026-05-18T04:15:50.757905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:50.757905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eCIKxouyfzYskqCJDCl4Ol/PIMUdeIz47mwc35DX1Qt435/5S3mzvPCC8BhQUR1oRQgWhXgBEjujm7lijZVrAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:50.758496Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.1983","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff23c6f424271b89e72d592be1c9a2d64e7680104718b1f87631e3586a01ec94","sha256:e3fe99a227ef51e99de6a15b4befd66f34ed395dcf5b48d3f2f51b6b12d0de12"],"state_sha256":"17b9bdbac09cc9c6b6f42623b69e01ac28864ee47cf20bbc8d6c813bfb432c1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6DUDSZEFcHFfqdAP/J752xswKuUFqGuuNwwXFvJu3h1uRwWvZj4XwJ6hdfZBOZ91LQvhaanjAOdNN2zO83yCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T14:03:54.477137Z","bundle_sha256":"4d355d836aa5ff870e491c07be47876e6c38b23553fcf5f4c2a8fdcadc545f3d"}}