{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RCSJEF7GH5QHCPMQNJMYCXAK5V","short_pith_number":"pith:RCSJEF7G","schema_version":"1.0","canonical_sha256":"88a49217e63f60713d906a59815c0aed73d5decfed0eb20f68f808c566616bf5","source":{"kind":"arxiv","id":"1902.01444","version":1},"attestation_state":"computed","paper":{"title":"\"Choix de Bruxelles\": A New Operation on Positive Integers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Charlie Neder, Eric Angelini, Lars Blomberg, N. J. A. Sloane, Remy Sigrist","submitted_at":"2019-02-04T19:56:19Z","abstract_excerpt":"The \"Choix de Bruxelles\" operation replaces a positive integer n by any of the numbers that can be obtained by halving or doubling a substring of the decimal representation of n. For example, 16 can become any of 16, 26, 13, 112, 8, or 32. We investigate the properties of this interesting operation and its iterates."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1902.01444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-02-04T19:56:19Z","cross_cats_sorted":[],"title_canon_sha256":"a69659e3815cb06b0c306b3036e27dda992df93e527378388ec138c9221be3ec","abstract_canon_sha256":"bd008b24dcf1c08fa92432d6ba55bcddbebe6f51a53662f24a4cdd3b3ea36593"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:47.693249Z","signature_b64":"9FnO3cJ74wmyTt551KGB4nK3Qdtbi0gGk5LIPHyKwslxiECgYzybBjuJOCPryoKH8p6SJ3HkoKXmmj7+YdzNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88a49217e63f60713d906a59815c0aed73d5decfed0eb20f68f808c566616bf5","last_reissued_at":"2026-05-17T23:54:47.692696Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:47.692696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"\"Choix de Bruxelles\": A New Operation on Positive Integers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Charlie Neder, Eric Angelini, Lars Blomberg, N. J. A. Sloane, Remy Sigrist","submitted_at":"2019-02-04T19:56:19Z","abstract_excerpt":"The \"Choix de Bruxelles\" operation replaces a positive integer n by any of the numbers that can be obtained by halving or doubling a substring of the decimal representation of n. For example, 16 can become any of 16, 26, 13, 112, 8, or 32. We investigate the properties of this interesting operation and its iterates."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01444","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.01444","created_at":"2026-05-17T23:54:47.692766+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.01444v1","created_at":"2026-05-17T23:54:47.692766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01444","created_at":"2026-05-17T23:54:47.692766+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCSJEF7GH5QH","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCSJEF7GH5QHCPMQ","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCSJEF7G","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RCSJEF7GH5QHCPMQNJMYCXAK5V","json":"https://pith.science/pith/RCSJEF7GH5QHCPMQNJMYCXAK5V.json","graph_json":"https://pith.science/api/pith-number/RCSJEF7GH5QHCPMQNJMYCXAK5V/graph.json","events_json":"https://pith.science/api/pith-number/RCSJEF7GH5QHCPMQNJMYCXAK5V/events.json","paper":"https://pith.science/paper/RCSJEF7G"},"agent_actions":{"view_html":"https://pith.science/pith/RCSJEF7GH5QHCPMQNJMYCXAK5V","download_json":"https://pith.science/pith/RCSJEF7GH5QHCPMQNJMYCXAK5V.json","view_paper":"https://pith.science/paper/RCSJEF7G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.01444&json=true","fetch_graph":"https://pith.science/api/pith-number/RCSJEF7GH5QHCPMQNJMYCXAK5V/graph.json","fetch_events":"https://pith.science/api/pith-number/RCSJEF7GH5QHCPMQNJMYCXAK5V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCSJEF7GH5QHCPMQNJMYCXAK5V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCSJEF7GH5QHCPMQNJMYCXAK5V/action/storage_attestation","attest_author":"https://pith.science/pith/RCSJEF7GH5QHCPMQNJMYCXAK5V/action/author_attestation","sign_citation":"https://pith.science/pith/RCSJEF7GH5QHCPMQNJMYCXAK5V/action/citation_signature","submit_replication":"https://pith.science/pith/RCSJEF7GH5QHCPMQNJMYCXAK5V/action/replication_record"}},"created_at":"2026-05-17T23:54:47.692766+00:00","updated_at":"2026-05-17T23:54:47.692766+00:00"}