{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PEQ6DMB3VKWLJRDD7OBPF7YKVV","short_pith_number":"pith:PEQ6DMB3","schema_version":"1.0","canonical_sha256":"7921e1b03baaacb4c463fb82f2ff0aad565de4d23b149220402d237c04cb1cf6","source":{"kind":"arxiv","id":"1310.7090","version":2},"attestation_state":"computed","paper":{"title":"Addition Chains Meet Postage Stamps: Reducing the Number of Multiplications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Jukka Corander, Jukka Kohonen","submitted_at":"2013-10-26T09:45:38Z","abstract_excerpt":"We introduce stamp chains. A stamp chain is a finite integer sequence that is both an addition chain and an additive 2-basis, i.e., a solution to the postage stamp problem. We provide a simple method for converting known postage stamp solutions of length k into stamp chains of length k+1. Using stamp chains, we construct an algorithm that computes u(x^i) for i=1,...,n in less than n-1 multiplications, if u is a function that can be computed at zero cost, and if there exists another zero-cost function v such that v(a,b) = u(ab). This can substantially reduce the computational cost of repeated m"},"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":"1310.7090","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-10-26T09:45:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a9f78d0fc528b8a7cfc07e73ebf61c93c3cb9df1fb9523c1c26017a84d5451e9","abstract_canon_sha256":"98424e4dfffc28cbc31e932f8b490627713ee6e231ca0fc90a48d4c662774a15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:14.072067Z","signature_b64":"UfT1a27eFQKA5K1Ke0oloOD84HnoOKo3ILBzuVUfv/5xRlWC4WxfkfLoBWkJvsrIpu7UC/U0jUlxn8mzeCE5Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7921e1b03baaacb4c463fb82f2ff0aad565de4d23b149220402d237c04cb1cf6","last_reissued_at":"2026-05-18T00:04:14.071464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:14.071464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Addition Chains Meet Postage Stamps: Reducing the Number of Multiplications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Jukka Corander, Jukka Kohonen","submitted_at":"2013-10-26T09:45:38Z","abstract_excerpt":"We introduce stamp chains. A stamp chain is a finite integer sequence that is both an addition chain and an additive 2-basis, i.e., a solution to the postage stamp problem. We provide a simple method for converting known postage stamp solutions of length k into stamp chains of length k+1. Using stamp chains, we construct an algorithm that computes u(x^i) for i=1,...,n in less than n-1 multiplications, if u is a function that can be computed at zero cost, and if there exists another zero-cost function v such that v(a,b) = u(ab). This can substantially reduce the computational cost of repeated m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7090","kind":"arxiv","version":2},"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":"1310.7090","created_at":"2026-05-18T00:04:14.071553+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.7090v2","created_at":"2026-05-18T00:04:14.071553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7090","created_at":"2026-05-18T00:04:14.071553+00:00"},{"alias_kind":"pith_short_12","alias_value":"PEQ6DMB3VKWL","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PEQ6DMB3VKWLJRDD","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PEQ6DMB3","created_at":"2026-05-18T12:27:54.935989+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/PEQ6DMB3VKWLJRDD7OBPF7YKVV","json":"https://pith.science/pith/PEQ6DMB3VKWLJRDD7OBPF7YKVV.json","graph_json":"https://pith.science/api/pith-number/PEQ6DMB3VKWLJRDD7OBPF7YKVV/graph.json","events_json":"https://pith.science/api/pith-number/PEQ6DMB3VKWLJRDD7OBPF7YKVV/events.json","paper":"https://pith.science/paper/PEQ6DMB3"},"agent_actions":{"view_html":"https://pith.science/pith/PEQ6DMB3VKWLJRDD7OBPF7YKVV","download_json":"https://pith.science/pith/PEQ6DMB3VKWLJRDD7OBPF7YKVV.json","view_paper":"https://pith.science/paper/PEQ6DMB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.7090&json=true","fetch_graph":"https://pith.science/api/pith-number/PEQ6DMB3VKWLJRDD7OBPF7YKVV/graph.json","fetch_events":"https://pith.science/api/pith-number/PEQ6DMB3VKWLJRDD7OBPF7YKVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PEQ6DMB3VKWLJRDD7OBPF7YKVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PEQ6DMB3VKWLJRDD7OBPF7YKVV/action/storage_attestation","attest_author":"https://pith.science/pith/PEQ6DMB3VKWLJRDD7OBPF7YKVV/action/author_attestation","sign_citation":"https://pith.science/pith/PEQ6DMB3VKWLJRDD7OBPF7YKVV/action/citation_signature","submit_replication":"https://pith.science/pith/PEQ6DMB3VKWLJRDD7OBPF7YKVV/action/replication_record"}},"created_at":"2026-05-18T00:04:14.071553+00:00","updated_at":"2026-05-18T00:04:14.071553+00:00"}