{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BB7MUR62MEINUP4JNBQAPE35UD","short_pith_number":"pith:BB7MUR62","canonical_record":{"source":{"id":"1311.7369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-28T16:52:43Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"0cfb0230ca74656c770681e3755cb4af6ae0c975b0adf7615e26c9742f70229b","abstract_canon_sha256":"669d93e4240ee22464e57da7b3a47cc3f249d0146e00198ae5f87b2054a7d709"},"schema_version":"1.0"},"canonical_sha256":"087eca47da6110da3f89686007937da0d69cda8b44bf37f7d6dacbeb7b593986","source":{"kind":"arxiv","id":"1311.7369","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7369","created_at":"2026-05-18T03:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7369v1","created_at":"2026-05-18T03:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7369","created_at":"2026-05-18T03:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"BB7MUR62MEIN","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BB7MUR62MEINUP4J","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BB7MUR62","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BB7MUR62MEINUP4JNBQAPE35UD","target":"record","payload":{"canonical_record":{"source":{"id":"1311.7369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-28T16:52:43Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"0cfb0230ca74656c770681e3755cb4af6ae0c975b0adf7615e26c9742f70229b","abstract_canon_sha256":"669d93e4240ee22464e57da7b3a47cc3f249d0146e00198ae5f87b2054a7d709"},"schema_version":"1.0"},"canonical_sha256":"087eca47da6110da3f89686007937da0d69cda8b44bf37f7d6dacbeb7b593986","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:56.527006Z","signature_b64":"HKbNSczMQ20xovpzN59vTiLSkys9us2A2PiNo0XyR+3xaEHmXTgei/05AvJjKNMPUSbDhugNBelUB9gK0Ix0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"087eca47da6110da3f89686007937da0d69cda8b44bf37f7d6dacbeb7b593986","last_reissued_at":"2026-05-18T03:05:56.526337Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:56.526337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.7369","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-18T03:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LKc/XmLeHSyYePoiOVaGsieAPKqzn74lhpi/OAkNi9KqEe03JXhL62J9mnhMHZblzTpdbTDhXveL6krTstLmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T04:10:48.751428Z"},"content_sha256":"ed92400bb62ef2d16da6fdf38af7cfb49d720fb6c0e04cb0d78e58193c264416","schema_version":"1.0","event_id":"sha256:ed92400bb62ef2d16da6fdf38af7cfb49d720fb6c0e04cb0d78e58193c264416"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BB7MUR62MEINUP4JNBQAPE35UD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Worst-Case Analysis of Weber's Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Christian Lavault (LIPN), Sidi Mohamed Sedjelmaci (LIPN)","submitted_at":"2013-11-28T16:52:43Z","abstract_excerpt":"Recently, Ken Weber introduced an algorithm for finding the $(a,b)$-pairs satisfying $au+bv\\equiv 0\\pmod{k}$, with $0<|a|,|b|<\\sqrt{k}$, where $(u,k)$ and $(v,k)$ are coprime. It is based on Sorenson's and Jebelean's \"$k$-ary reduction\" algorithms. We provide a formula for $N(k)$, the maximal number of iterations in the loop of Weber's GCD algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7369","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-18T03:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FLaGejLaCVm9G6Wykuw3c1hs0f7R0AM9A/8tu7M8X/tUo+63iRYGkF5ECmlsV0ahMwqsBpl7eJTHg1Kh0/L+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T04:10:48.752140Z"},"content_sha256":"04e40a67df21a5bfd031187a71e3e0a552e0a6f42d1cd849db6441b9411a4303","schema_version":"1.0","event_id":"sha256:04e40a67df21a5bfd031187a71e3e0a552e0a6f42d1cd849db6441b9411a4303"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BB7MUR62MEINUP4JNBQAPE35UD/bundle.json","state_url":"https://pith.science/pith/BB7MUR62MEINUP4JNBQAPE35UD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BB7MUR62MEINUP4JNBQAPE35UD/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-07-04T04:10:48Z","links":{"resolver":"https://pith.science/pith/BB7MUR62MEINUP4JNBQAPE35UD","bundle":"https://pith.science/pith/BB7MUR62MEINUP4JNBQAPE35UD/bundle.json","state":"https://pith.science/pith/BB7MUR62MEINUP4JNBQAPE35UD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BB7MUR62MEINUP4JNBQAPE35UD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BB7MUR62MEINUP4JNBQAPE35UD","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":"669d93e4240ee22464e57da7b3a47cc3f249d0146e00198ae5f87b2054a7d709","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-28T16:52:43Z","title_canon_sha256":"0cfb0230ca74656c770681e3755cb4af6ae0c975b0adf7615e26c9742f70229b"},"schema_version":"1.0","source":{"id":"1311.7369","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7369","created_at":"2026-05-18T03:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7369v1","created_at":"2026-05-18T03:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7369","created_at":"2026-05-18T03:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"BB7MUR62MEIN","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BB7MUR62MEINUP4J","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BB7MUR62","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:04e40a67df21a5bfd031187a71e3e0a552e0a6f42d1cd849db6441b9411a4303","target":"graph","created_at":"2026-05-18T03:05:56Z","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":"Recently, Ken Weber introduced an algorithm for finding the $(a,b)$-pairs satisfying $au+bv\\equiv 0\\pmod{k}$, with $0<|a|,|b|<\\sqrt{k}$, where $(u,k)$ and $(v,k)$ are coprime. It is based on Sorenson's and Jebelean's \"$k$-ary reduction\" algorithms. We provide a formula for $N(k)$, the maximal number of iterations in the loop of Weber's GCD algorithm.","authors_text":"Christian Lavault (LIPN), Sidi Mohamed Sedjelmaci (LIPN)","cross_cats":["cs.CC","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-28T16:52:43Z","title":"Worst-Case Analysis of Weber's Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7369","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:ed92400bb62ef2d16da6fdf38af7cfb49d720fb6c0e04cb0d78e58193c264416","target":"record","created_at":"2026-05-18T03:05:56Z","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":"669d93e4240ee22464e57da7b3a47cc3f249d0146e00198ae5f87b2054a7d709","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-28T16:52:43Z","title_canon_sha256":"0cfb0230ca74656c770681e3755cb4af6ae0c975b0adf7615e26c9742f70229b"},"schema_version":"1.0","source":{"id":"1311.7369","kind":"arxiv","version":1}},"canonical_sha256":"087eca47da6110da3f89686007937da0d69cda8b44bf37f7d6dacbeb7b593986","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"087eca47da6110da3f89686007937da0d69cda8b44bf37f7d6dacbeb7b593986","first_computed_at":"2026-05-18T03:05:56.526337Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:56.526337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HKbNSczMQ20xovpzN59vTiLSkys9us2A2PiNo0XyR+3xaEHmXTgei/05AvJjKNMPUSbDhugNBelUB9gK0Ix0Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:56.527006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.7369","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed92400bb62ef2d16da6fdf38af7cfb49d720fb6c0e04cb0d78e58193c264416","sha256:04e40a67df21a5bfd031187a71e3e0a552e0a6f42d1cd849db6441b9411a4303"],"state_sha256":"4c279f13f2f9968c48661a8da0378e041fffaa8cae9e34ffcc55a91b66aa216a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rq4dhN8ivor2V4qCEDf7ajOQge315eOuLFUIVYQ09V8doCkz7zatJEAlvfBttUYazt/01TuOM5DvNmr64/dGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T04:10:48.755725Z","bundle_sha256":"05dd21ff56a2f6e32366951d4bfe67a86d7909f35825997d884ce62b4bdd9ad6"}}