{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TWZAYPWWN53SJ76BYHQWANTFFV","short_pith_number":"pith:TWZAYPWW","schema_version":"1.0","canonical_sha256":"9db20c3ed66f7724ffc1c1e16036652d7bc3222158e3211385173e5a1f1738d4","source":{"kind":"arxiv","id":"1807.02075","version":2},"attestation_state":"computed","paper":{"title":"Analysis of Nederlof's algorithm for subset sum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Lihua Liu, Zhen Chen, Zhengjun Cao","submitted_at":"2018-06-10T03:41:09Z","abstract_excerpt":"We show that Nederlof's algorithm [Information Processing Letters, 118 (2017), 15-16] for constructing a proof that the number of subsets summing to a particular integer equals a claimed quantity is flawed because: 1) its consistence is not kept; 2) the proposed recurrence formula is incorrect."},"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":"1807.02075","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-10T03:41:09Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"04114284fdd40987bc77038747f6046030a562c05c598123b5080a1b1e4a879e","abstract_canon_sha256":"86ce69101824db90a50f17c368e34d99b097a69022c2d9278e0fb9648aa67928"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:23.055917Z","signature_b64":"LGkJg3mIKBUS/D31zXf2B3POsIGP36dcrEZFcuRY3ZNuiO5xPjOKuuBgiAl36CWU/i0VLO2MCoVneqBI5b05DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9db20c3ed66f7724ffc1c1e16036652d7bc3222158e3211385173e5a1f1738d4","last_reissued_at":"2026-05-18T00:11:23.055388Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:23.055388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of Nederlof's algorithm for subset sum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Lihua Liu, Zhen Chen, Zhengjun Cao","submitted_at":"2018-06-10T03:41:09Z","abstract_excerpt":"We show that Nederlof's algorithm [Information Processing Letters, 118 (2017), 15-16] for constructing a proof that the number of subsets summing to a particular integer equals a claimed quantity is flawed because: 1) its consistence is not kept; 2) the proposed recurrence formula is incorrect."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02075","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":"1807.02075","created_at":"2026-05-18T00:11:23.055464+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.02075v2","created_at":"2026-05-18T00:11:23.055464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02075","created_at":"2026-05-18T00:11:23.055464+00:00"},{"alias_kind":"pith_short_12","alias_value":"TWZAYPWWN53S","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"TWZAYPWWN53SJ76B","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"TWZAYPWW","created_at":"2026-05-18T12:32:56.356000+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/TWZAYPWWN53SJ76BYHQWANTFFV","json":"https://pith.science/pith/TWZAYPWWN53SJ76BYHQWANTFFV.json","graph_json":"https://pith.science/api/pith-number/TWZAYPWWN53SJ76BYHQWANTFFV/graph.json","events_json":"https://pith.science/api/pith-number/TWZAYPWWN53SJ76BYHQWANTFFV/events.json","paper":"https://pith.science/paper/TWZAYPWW"},"agent_actions":{"view_html":"https://pith.science/pith/TWZAYPWWN53SJ76BYHQWANTFFV","download_json":"https://pith.science/pith/TWZAYPWWN53SJ76BYHQWANTFFV.json","view_paper":"https://pith.science/paper/TWZAYPWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.02075&json=true","fetch_graph":"https://pith.science/api/pith-number/TWZAYPWWN53SJ76BYHQWANTFFV/graph.json","fetch_events":"https://pith.science/api/pith-number/TWZAYPWWN53SJ76BYHQWANTFFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TWZAYPWWN53SJ76BYHQWANTFFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TWZAYPWWN53SJ76BYHQWANTFFV/action/storage_attestation","attest_author":"https://pith.science/pith/TWZAYPWWN53SJ76BYHQWANTFFV/action/author_attestation","sign_citation":"https://pith.science/pith/TWZAYPWWN53SJ76BYHQWANTFFV/action/citation_signature","submit_replication":"https://pith.science/pith/TWZAYPWWN53SJ76BYHQWANTFFV/action/replication_record"}},"created_at":"2026-05-18T00:11:23.055464+00:00","updated_at":"2026-05-18T00:11:23.055464+00:00"}