{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HSSKSGISKICAF4PLBKNX44L3Y4","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":"b2326dac9c7b90fec26f8022559e25562d3e558e78ebf9e10f9e83ba59882574","cross_cats_sorted":["cs.CR","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-01-03T16:58:23Z","title_canon_sha256":"89c7479e1bc40ea18e627cb5c57c3e05f150e0bfd42de0e82995e1021e05410a"},"schema_version":"1.0","source":{"id":"1101.0564","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.0564","created_at":"2026-05-18T03:52:51Z"},{"alias_kind":"arxiv_version","alias_value":"1101.0564v1","created_at":"2026-05-18T03:52:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0564","created_at":"2026-05-18T03:52:51Z"},{"alias_kind":"pith_short_12","alias_value":"HSSKSGISKICA","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HSSKSGISKICAF4PL","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HSSKSGIS","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:d3cf2613dbae2a553e569a12e0de085651d89a9fc2eebb42b23c3f92eb2499ba","target":"graph","created_at":"2026-05-18T03:52:51Z","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 describe a space-efficient algorithm for solving a generalization of the subset sum problem in a finite group G, using a Pollard-rho approach. Given an element z and a sequence of elements S, our algorithm attempts to find a subsequence of S whose product in G is equal to z. For a random sequence S of length d log_2 n, where n=#G and d >= 2 is a constant, we find that its expected running time is O(sqrt(n) log n) group operations (we give a rigorous proof for d > 4), and it only needs to store O(1) group elements. We consider applications to class groups of imaginary quadratic fields, and t","authors_text":"Andrew V. Sutherland, Gaetan Bisson","cross_cats":["cs.CR","math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-01-03T16:58:23Z","title":"A low-memory algorithm for finding short product representations in finite groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0564","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:167585ab45b77a4a28683474aa8d82824d3613a62f4d9ca6fd795e6bd062ab82","target":"record","created_at":"2026-05-18T03:52:51Z","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":"b2326dac9c7b90fec26f8022559e25562d3e558e78ebf9e10f9e83ba59882574","cross_cats_sorted":["cs.CR","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-01-03T16:58:23Z","title_canon_sha256":"89c7479e1bc40ea18e627cb5c57c3e05f150e0bfd42de0e82995e1021e05410a"},"schema_version":"1.0","source":{"id":"1101.0564","kind":"arxiv","version":1}},"canonical_sha256":"3ca4a91912520402f1eb0a9b7e717bc738fe86192d627bbbd47af9825341a9ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ca4a91912520402f1eb0a9b7e717bc738fe86192d627bbbd47af9825341a9ba","first_computed_at":"2026-05-18T03:52:51.460454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:51.460454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FZlhlBOhXIYbtFtbIZQr73JVgpSMH4bufZjc+OFlt6gGUHqMgEW6ZOgH52RJs9ht6eNqWsUhnGuHR3BvXNwHDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:51.461250Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.0564","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:167585ab45b77a4a28683474aa8d82824d3613a62f4d9ca6fd795e6bd062ab82","sha256:d3cf2613dbae2a553e569a12e0de085651d89a9fc2eebb42b23c3f92eb2499ba"],"state_sha256":"751a2c7ee5537c87aac4be7ae17c242ff67b02d09a3be4c7bfb98038f9b9c1ff"}