{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:26OXI7OYWGRBN2AF2DXT7BPVFY","short_pith_number":"pith:26OXI7OY","schema_version":"1.0","canonical_sha256":"d79d747dd8b1a216e805d0ef3f85f52e11ab397f55823b76f31c38084f44fd58","source":{"kind":"arxiv","id":"2411.18137","version":1},"attestation_state":"computed","paper":{"title":"The Greedy Coin Change Problem","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Boyang Huang, Russell Impagliazzo, Shreya Gupta","submitted_at":"2024-11-27T08:37:47Z","abstract_excerpt":"The Coin Change problem, also known as the Change-Making problem, is a well-studied combinatorial optimization problem, which involves minimizing the number of coins needed to make a specific change amount using a given set of coin denominations. A natural and intuitive approach to this problem is the greedy algorithm. While the greedy algorithm is not universally optimal for all sets of coin denominations, it yields optimal solutions under most real-world coin systems currently in use, making it an efficient heuristic with broad practical applicability. Researchers have been studying ways to "},"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":"2411.18137","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2024-11-27T08:37:47Z","cross_cats_sorted":[],"title_canon_sha256":"4758adcb9e429074ea0fc0d5d107bd3b2fbc1cca7e6ed3a2edd23faba9c82eed","abstract_canon_sha256":"b98a181137e7ba9d0856f386e7e537536586b2af4d100f7e6e6b829582430115"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:12.322934Z","signature_b64":"Ao/faZ13FIxyNoZrusaSjm4TTzxCunV1i3QXBv/nLuqNCMZIYGDMNGvkJqrhy7w0X7qaMsVLKH3ax3GVdFJcCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d79d747dd8b1a216e805d0ef3f85f52e11ab397f55823b76f31c38084f44fd58","last_reissued_at":"2026-07-05T09:41:12.322497Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:12.322497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Greedy Coin Change Problem","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Boyang Huang, Russell Impagliazzo, Shreya Gupta","submitted_at":"2024-11-27T08:37:47Z","abstract_excerpt":"The Coin Change problem, also known as the Change-Making problem, is a well-studied combinatorial optimization problem, which involves minimizing the number of coins needed to make a specific change amount using a given set of coin denominations. A natural and intuitive approach to this problem is the greedy algorithm. While the greedy algorithm is not universally optimal for all sets of coin denominations, it yields optimal solutions under most real-world coin systems currently in use, making it an efficient heuristic with broad practical applicability. Researchers have been studying ways to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.18137","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.18137/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.18137","created_at":"2026-07-05T09:41:12.322573+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.18137v1","created_at":"2026-07-05T09:41:12.322573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.18137","created_at":"2026-07-05T09:41:12.322573+00:00"},{"alias_kind":"pith_short_12","alias_value":"26OXI7OYWGRB","created_at":"2026-07-05T09:41:12.322573+00:00"},{"alias_kind":"pith_short_16","alias_value":"26OXI7OYWGRBN2AF","created_at":"2026-07-05T09:41:12.322573+00:00"},{"alias_kind":"pith_short_8","alias_value":"26OXI7OY","created_at":"2026-07-05T09:41:12.322573+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/26OXI7OYWGRBN2AF2DXT7BPVFY","json":"https://pith.science/pith/26OXI7OYWGRBN2AF2DXT7BPVFY.json","graph_json":"https://pith.science/api/pith-number/26OXI7OYWGRBN2AF2DXT7BPVFY/graph.json","events_json":"https://pith.science/api/pith-number/26OXI7OYWGRBN2AF2DXT7BPVFY/events.json","paper":"https://pith.science/paper/26OXI7OY"},"agent_actions":{"view_html":"https://pith.science/pith/26OXI7OYWGRBN2AF2DXT7BPVFY","download_json":"https://pith.science/pith/26OXI7OYWGRBN2AF2DXT7BPVFY.json","view_paper":"https://pith.science/paper/26OXI7OY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.18137&json=true","fetch_graph":"https://pith.science/api/pith-number/26OXI7OYWGRBN2AF2DXT7BPVFY/graph.json","fetch_events":"https://pith.science/api/pith-number/26OXI7OYWGRBN2AF2DXT7BPVFY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/26OXI7OYWGRBN2AF2DXT7BPVFY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/26OXI7OYWGRBN2AF2DXT7BPVFY/action/storage_attestation","attest_author":"https://pith.science/pith/26OXI7OYWGRBN2AF2DXT7BPVFY/action/author_attestation","sign_citation":"https://pith.science/pith/26OXI7OYWGRBN2AF2DXT7BPVFY/action/citation_signature","submit_replication":"https://pith.science/pith/26OXI7OYWGRBN2AF2DXT7BPVFY/action/replication_record"}},"created_at":"2026-07-05T09:41:12.322573+00:00","updated_at":"2026-07-05T09:41:12.322573+00:00"}