{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ISX5MMBIDZC3ZQC4PRAZJT4BDI","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":"6aa939740ac0345153b9a82449914a12d3a6cf7bf596362dfce7f8bfecdccc58","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2025-08-29T20:55:35Z","title_canon_sha256":"930601ea03b94f05363faf8ebabcb1f2860fe6e1113d2a8d9e661ff1c39781ea"},"schema_version":"1.0","source":{"id":"2509.00236","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.00236","created_at":"2026-07-05T12:02:11Z"},{"alias_kind":"arxiv_version","alias_value":"2509.00236v1","created_at":"2026-07-05T12:02:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.00236","created_at":"2026-07-05T12:02:11Z"},{"alias_kind":"pith_short_12","alias_value":"ISX5MMBIDZC3","created_at":"2026-07-05T12:02:11Z"},{"alias_kind":"pith_short_16","alias_value":"ISX5MMBIDZC3ZQC4","created_at":"2026-07-05T12:02:11Z"},{"alias_kind":"pith_short_8","alias_value":"ISX5MMBI","created_at":"2026-07-05T12:02:11Z"}],"graph_snapshots":[{"event_id":"sha256:76b8f347a7474f353232c1974acea47c03c002475792437e24a51634c39d0ec9","target":"graph","created_at":"2026-07-05T12:02:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.00236/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In his 1963 paper on the sum of consecutive primes, Moser posed four open questions related to $f(n)$, the number of ways an integer $n$ can be written as a sum of consecutive primes. (See also problem C2 from Richard K.~Guy's \\textit{Unsolved Problems in Number Theory}.) In this paper, we present and analyze two algorithms that, when given a bound $x$, construct a histogram of values of $f(n)$ for all $n\\le x$. These two algorithms were described, but not analyzed, by Jean Charles Meyrignac (2000) and Michael S. Branicky (2022). We show the first algorithm takes $O(x\\log x)$ time using $x^{2/","authors_text":"Eleanor Waiss, Jonathan P. Sorenson","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2025-08-29T20:55:35Z","title":"Analysis of Algorithms for Moser's Problems on Sums of Consecutive Primes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.00236","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:f947464c586b74c8ec8c34037aff15cff91f5c407a103eb212fbc1309667a446","target":"record","created_at":"2026-07-05T12:02:11Z","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":"6aa939740ac0345153b9a82449914a12d3a6cf7bf596362dfce7f8bfecdccc58","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2025-08-29T20:55:35Z","title_canon_sha256":"930601ea03b94f05363faf8ebabcb1f2860fe6e1113d2a8d9e661ff1c39781ea"},"schema_version":"1.0","source":{"id":"2509.00236","kind":"arxiv","version":1}},"canonical_sha256":"44afd630281e45bcc05c7c4194cf811a2f7e5789f47b9ddaa2f5187192650426","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44afd630281e45bcc05c7c4194cf811a2f7e5789f47b9ddaa2f5187192650426","first_computed_at":"2026-07-05T12:02:11.891228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:02:11.891228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qw5u3Gke4Pt07flqADE598M6UbIOc5CWJXQob4fAwwyq5aHgEkfEigbA2OQgIFyLoHl7wXyvyJ8BUxGcPr97Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T12:02:11.891648Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.00236","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f947464c586b74c8ec8c34037aff15cff91f5c407a103eb212fbc1309667a446","sha256:76b8f347a7474f353232c1974acea47c03c002475792437e24a51634c39d0ec9"],"state_sha256":"1176d61cd4638218b5c548c9b7a70be73120283b182e27e4970edacd708c4c39"}