{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3WEFS7IRXTDBHVKLR6ROVZLXJD","short_pith_number":"pith:3WEFS7IR","canonical_record":{"source":{"id":"1201.3181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-16T09:20:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0f4b95e9a79a8b60b82e46c7015ee7bcced28fb5cff39bbc59612766a0bca285","abstract_canon_sha256":"530034779a7e5d4d9e9d44b573c755f438910907ba523e6b601612227da4883e"},"schema_version":"1.0"},"canonical_sha256":"dd88597d11bcc613d54b8fa2eae57748ce0944ca276196a131d6ed13817eea43","source":{"kind":"arxiv","id":"1201.3181","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.3181","created_at":"2026-05-18T04:04:31Z"},{"alias_kind":"arxiv_version","alias_value":"1201.3181v1","created_at":"2026-05-18T04:04:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3181","created_at":"2026-05-18T04:04:31Z"},{"alias_kind":"pith_short_12","alias_value":"3WEFS7IRXTDB","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3WEFS7IRXTDBHVKL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3WEFS7IR","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3WEFS7IRXTDBHVKLR6ROVZLXJD","target":"record","payload":{"canonical_record":{"source":{"id":"1201.3181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-16T09:20:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0f4b95e9a79a8b60b82e46c7015ee7bcced28fb5cff39bbc59612766a0bca285","abstract_canon_sha256":"530034779a7e5d4d9e9d44b573c755f438910907ba523e6b601612227da4883e"},"schema_version":"1.0"},"canonical_sha256":"dd88597d11bcc613d54b8fa2eae57748ce0944ca276196a131d6ed13817eea43","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:31.978523Z","signature_b64":"cwqLJLjSkrlTEvzSm1s9znDcHXpVG9JxfAZppe8nX4npFAt3z2MdYCXlKwK8po9dYlnFGUoOHYu/atsG4+snAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd88597d11bcc613d54b8fa2eae57748ce0944ca276196a131d6ed13817eea43","last_reissued_at":"2026-05-18T04:04:31.977798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:31.977798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.3181","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:04:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w4TnaDH4mJuNJ87iVd7ZybZUcmh/Q8XzqViG5J/xJLy94uQwwcj8n8nP3Lm6qoMrPmloC6WUbJSOWe2ELIp9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:16:34.006311Z"},"content_sha256":"28cf63c0a5628765f3a10859fab03a6fb3cc8012922ac696965c214abe1e6aac","schema_version":"1.0","event_id":"sha256:28cf63c0a5628765f3a10859fab03a6fb3cc8012922ac696965c214abe1e6aac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3WEFS7IRXTDBHVKLR6ROVZLXJD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Optimal Expanding Generating Sets for Solvable Permutation Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Partha Mukhopadhyay, Prajakta Nimbhorkar, V. Arvind, Yadu Vasudev","submitted_at":"2012-01-16T09:20:37Z","abstract_excerpt":"Let $G =<S>$ be a solvable permutation group of the symmetric group $S_n$ given as input by the generating set $S$. We give a deterministic polynomial-time algorithm that computes an \\emph{expanding generating set} of size $\\tilde{O}(n^2)$ for $G$. More precisely, the algorithm computes a subset $T\\subset G$ of size $\\tilde{O}(n^2)(1/\\lambda)^{O(1)}$ such that the undirected Cayley graph $Cay(G,T)$ is a $\\lambda$-spectral expander (the $\\tilde{O}$ notation suppresses $\\log ^{O(1)}n$ factors). As a byproduct of our proof, we get a new explicit construction of $\\varepsilon$-bias spaces of size $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3181","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:04:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FAB7f8Ho3lgvjKCY+1WQEM8Wgl3cnJi0SeKM2RKkPP+gJKrYiBUeMHGXI784WLMgfoS3pp4IzYKjcdETtQdWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:16:34.007045Z"},"content_sha256":"27d3a2ee8aa46d2a9e3995b67f53fea0e8b5af7c4e2a6bbbf75f014f490fa9b0","schema_version":"1.0","event_id":"sha256:27d3a2ee8aa46d2a9e3995b67f53fea0e8b5af7c4e2a6bbbf75f014f490fa9b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3WEFS7IRXTDBHVKLR6ROVZLXJD/bundle.json","state_url":"https://pith.science/pith/3WEFS7IRXTDBHVKLR6ROVZLXJD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3WEFS7IRXTDBHVKLR6ROVZLXJD/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-09T07:16:34Z","links":{"resolver":"https://pith.science/pith/3WEFS7IRXTDBHVKLR6ROVZLXJD","bundle":"https://pith.science/pith/3WEFS7IRXTDBHVKLR6ROVZLXJD/bundle.json","state":"https://pith.science/pith/3WEFS7IRXTDBHVKLR6ROVZLXJD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3WEFS7IRXTDBHVKLR6ROVZLXJD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3WEFS7IRXTDBHVKLR6ROVZLXJD","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":"530034779a7e5d4d9e9d44b573c755f438910907ba523e6b601612227da4883e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-16T09:20:37Z","title_canon_sha256":"0f4b95e9a79a8b60b82e46c7015ee7bcced28fb5cff39bbc59612766a0bca285"},"schema_version":"1.0","source":{"id":"1201.3181","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.3181","created_at":"2026-05-18T04:04:31Z"},{"alias_kind":"arxiv_version","alias_value":"1201.3181v1","created_at":"2026-05-18T04:04:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3181","created_at":"2026-05-18T04:04:31Z"},{"alias_kind":"pith_short_12","alias_value":"3WEFS7IRXTDB","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3WEFS7IRXTDBHVKL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3WEFS7IR","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:27d3a2ee8aa46d2a9e3995b67f53fea0e8b5af7c4e2a6bbbf75f014f490fa9b0","target":"graph","created_at":"2026-05-18T04:04:31Z","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":"Let $G =<S>$ be a solvable permutation group of the symmetric group $S_n$ given as input by the generating set $S$. We give a deterministic polynomial-time algorithm that computes an \\emph{expanding generating set} of size $\\tilde{O}(n^2)$ for $G$. More precisely, the algorithm computes a subset $T\\subset G$ of size $\\tilde{O}(n^2)(1/\\lambda)^{O(1)}$ such that the undirected Cayley graph $Cay(G,T)$ is a $\\lambda$-spectral expander (the $\\tilde{O}$ notation suppresses $\\log ^{O(1)}n$ factors). As a byproduct of our proof, we get a new explicit construction of $\\varepsilon$-bias spaces of size $","authors_text":"Partha Mukhopadhyay, Prajakta Nimbhorkar, V. Arvind, Yadu Vasudev","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-16T09:20:37Z","title":"Near-Optimal Expanding Generating Sets for Solvable Permutation Groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3181","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:28cf63c0a5628765f3a10859fab03a6fb3cc8012922ac696965c214abe1e6aac","target":"record","created_at":"2026-05-18T04:04:31Z","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":"530034779a7e5d4d9e9d44b573c755f438910907ba523e6b601612227da4883e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-16T09:20:37Z","title_canon_sha256":"0f4b95e9a79a8b60b82e46c7015ee7bcced28fb5cff39bbc59612766a0bca285"},"schema_version":"1.0","source":{"id":"1201.3181","kind":"arxiv","version":1}},"canonical_sha256":"dd88597d11bcc613d54b8fa2eae57748ce0944ca276196a131d6ed13817eea43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd88597d11bcc613d54b8fa2eae57748ce0944ca276196a131d6ed13817eea43","first_computed_at":"2026-05-18T04:04:31.977798Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:31.977798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cwqLJLjSkrlTEvzSm1s9znDcHXpVG9JxfAZppe8nX4npFAt3z2MdYCXlKwK8po9dYlnFGUoOHYu/atsG4+snAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:31.978523Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.3181","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28cf63c0a5628765f3a10859fab03a6fb3cc8012922ac696965c214abe1e6aac","sha256:27d3a2ee8aa46d2a9e3995b67f53fea0e8b5af7c4e2a6bbbf75f014f490fa9b0"],"state_sha256":"d970b8fa2a6600edf91bf67b4466de0eff096734c0f433aee8bb65c610fa11ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WIG6+TK7EeV95Disn/hFANKRrDJWFFJGNz5yyRvg6lQiPEELO4Welb61VrStBMdQao1Q8YB2Et4VpB68o5+uCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:16:34.011044Z","bundle_sha256":"ef812f0c51c02a813cc370217ff7c449e68d232b90cf2c0114d825d45c27b089"}}