{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:P5RMUN3OOLWAU3K54IRREOH3Q5","short_pith_number":"pith:P5RMUN3O","canonical_record":{"source":{"id":"1610.08299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-10-26T12:31:01Z","cross_cats_sorted":[],"title_canon_sha256":"4973f894b8ddfef58990602e3665fd6aa366fe2bccd1dbf093abe2aa2918e68f","abstract_canon_sha256":"30c260069ab381cddeb2ac6894cfe8db721e8982ca5c2e4282678347b4b68016"},"schema_version":"1.0"},"canonical_sha256":"7f62ca376e72ec0a6d5de2231238fb876870cba5c8f652b190317b199be1e5fd","source":{"kind":"arxiv","id":"1610.08299","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08299","created_at":"2026-05-18T01:01:14Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08299v1","created_at":"2026-05-18T01:01:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08299","created_at":"2026-05-18T01:01:14Z"},{"alias_kind":"pith_short_12","alias_value":"P5RMUN3OOLWA","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"P5RMUN3OOLWAU3K5","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"P5RMUN3O","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:P5RMUN3OOLWAU3K54IRREOH3Q5","target":"record","payload":{"canonical_record":{"source":{"id":"1610.08299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-10-26T12:31:01Z","cross_cats_sorted":[],"title_canon_sha256":"4973f894b8ddfef58990602e3665fd6aa366fe2bccd1dbf093abe2aa2918e68f","abstract_canon_sha256":"30c260069ab381cddeb2ac6894cfe8db721e8982ca5c2e4282678347b4b68016"},"schema_version":"1.0"},"canonical_sha256":"7f62ca376e72ec0a6d5de2231238fb876870cba5c8f652b190317b199be1e5fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:14.412140Z","signature_b64":"Re0OyTI8NkTgv5q04lW16B8iuaAhRCdFOCH/1aRyjTSEXiTsIUBXHejPhzUd0SedyL5JwFN1KevPq0KfDKACBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f62ca376e72ec0a6d5de2231238fb876870cba5c8f652b190317b199be1e5fd","last_reissued_at":"2026-05-18T01:01:14.411581Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:14.411581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.08299","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-18T01:01:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wkUSigt4MCKFNYEWw+lV7AWhykwomtF179jdL51a9w4JpNg1RcD1eje/bLqJRqELqhi/rBUtAYBjG6Nx6RftAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:01:08.034120Z"},"content_sha256":"85d4f94c74e63027b17237fd171e93a911d19a746730ccc1a81ed43fda4b4ced","schema_version":"1.0","event_id":"sha256:85d4f94c74e63027b17237fd171e93a911d19a746730ccc1a81ed43fda4b4ced"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:P5RMUN3OOLWAU3K54IRREOH3Q5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal digit sets for parallel addition in non-standard numeration systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Christiane Frougny, Edita Pelantova, Milena Svobodova","submitted_at":"2016-10-26T12:31:01Z","abstract_excerpt":"We study parallel algorithms for addition of numbers having finite representation in a positional numeration system defined by a base $\\beta$ in $\\mathbb{C}$ and a finite digit set $\\mathcal{A}$ of contiguous integers containing $0$. For a fixed base $\\beta$, we focus on the question of the size of the alphabet allowing to perform addition in constant time independently of the length of representation of the summands. We produce lower bounds on the size of such alphabet $\\mathcal{A}$. For several types of well studied bases (negative integer, complex numbers $ -1 + \\imath$, $2 \\imath$, and $\\i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08299","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-18T01:01:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PmydOGRqACsyu1mCVKQ6hzUneRuNs31pWWKfFuXWl4iXvBCFo66PXEE8W8IzbatAw8qNir+QSWKk+6QWCumrCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:01:08.034507Z"},"content_sha256":"009e1f7e8afda9873132ccbe09f848a9a8a647e45b93079a0f6e71d7e8467c70","schema_version":"1.0","event_id":"sha256:009e1f7e8afda9873132ccbe09f848a9a8a647e45b93079a0f6e71d7e8467c70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5RMUN3OOLWAU3K54IRREOH3Q5/bundle.json","state_url":"https://pith.science/pith/P5RMUN3OOLWAU3K54IRREOH3Q5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5RMUN3OOLWAU3K54IRREOH3Q5/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-23T04:01:08Z","links":{"resolver":"https://pith.science/pith/P5RMUN3OOLWAU3K54IRREOH3Q5","bundle":"https://pith.science/pith/P5RMUN3OOLWAU3K54IRREOH3Q5/bundle.json","state":"https://pith.science/pith/P5RMUN3OOLWAU3K54IRREOH3Q5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5RMUN3OOLWAU3K54IRREOH3Q5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:P5RMUN3OOLWAU3K54IRREOH3Q5","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":"30c260069ab381cddeb2ac6894cfe8db721e8982ca5c2e4282678347b4b68016","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-10-26T12:31:01Z","title_canon_sha256":"4973f894b8ddfef58990602e3665fd6aa366fe2bccd1dbf093abe2aa2918e68f"},"schema_version":"1.0","source":{"id":"1610.08299","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08299","created_at":"2026-05-18T01:01:14Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08299v1","created_at":"2026-05-18T01:01:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08299","created_at":"2026-05-18T01:01:14Z"},{"alias_kind":"pith_short_12","alias_value":"P5RMUN3OOLWA","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"P5RMUN3OOLWAU3K5","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"P5RMUN3O","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:009e1f7e8afda9873132ccbe09f848a9a8a647e45b93079a0f6e71d7e8467c70","target":"graph","created_at":"2026-05-18T01:01:14Z","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 study parallel algorithms for addition of numbers having finite representation in a positional numeration system defined by a base $\\beta$ in $\\mathbb{C}$ and a finite digit set $\\mathcal{A}$ of contiguous integers containing $0$. For a fixed base $\\beta$, we focus on the question of the size of the alphabet allowing to perform addition in constant time independently of the length of representation of the summands. We produce lower bounds on the size of such alphabet $\\mathcal{A}$. For several types of well studied bases (negative integer, complex numbers $ -1 + \\imath$, $2 \\imath$, and $\\i","authors_text":"Christiane Frougny, Edita Pelantova, Milena Svobodova","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-10-26T12:31:01Z","title":"Minimal digit sets for parallel addition in non-standard numeration systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08299","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:85d4f94c74e63027b17237fd171e93a911d19a746730ccc1a81ed43fda4b4ced","target":"record","created_at":"2026-05-18T01:01:14Z","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":"30c260069ab381cddeb2ac6894cfe8db721e8982ca5c2e4282678347b4b68016","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-10-26T12:31:01Z","title_canon_sha256":"4973f894b8ddfef58990602e3665fd6aa366fe2bccd1dbf093abe2aa2918e68f"},"schema_version":"1.0","source":{"id":"1610.08299","kind":"arxiv","version":1}},"canonical_sha256":"7f62ca376e72ec0a6d5de2231238fb876870cba5c8f652b190317b199be1e5fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f62ca376e72ec0a6d5de2231238fb876870cba5c8f652b190317b199be1e5fd","first_computed_at":"2026-05-18T01:01:14.411581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:14.411581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Re0OyTI8NkTgv5q04lW16B8iuaAhRCdFOCH/1aRyjTSEXiTsIUBXHejPhzUd0SedyL5JwFN1KevPq0KfDKACBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:14.412140Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.08299","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85d4f94c74e63027b17237fd171e93a911d19a746730ccc1a81ed43fda4b4ced","sha256:009e1f7e8afda9873132ccbe09f848a9a8a647e45b93079a0f6e71d7e8467c70"],"state_sha256":"ea3df67b28a08aed218b5da676b50022de491d66859f97ad681ccd485feeb614"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"siD1+XqRkLVbLqDcp2axMHoqQ4fxGY23qX3ppn4CtgZJjal6URgraRm8DdtlvEixFsfQLx5Er4jDAcgTBuntAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T04:01:08.036255Z","bundle_sha256":"08470f3bddefe08fa00ebe3dcee7de3a42feb3972a2ac8ddfecf2b86183543d3"}}