{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5K34NJPRLLF63G6JXSJIKECK4P","short_pith_number":"pith:5K34NJPR","schema_version":"1.0","canonical_sha256":"eab7c6a5f15acbed9bc9bc9285104ae3f11ecb795d67129d3a4a8eb5efac6fcf","source":{"kind":"arxiv","id":"1311.3874","version":1},"attestation_state":"computed","paper":{"title":"An Algorithm to Solve the Equal-Sum-Product Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"C. D. Evans, M. A. Nyblom","submitted_at":"2013-11-15T15:20:21Z","abstract_excerpt":"A recursive algorithm is constructed which finds all solutions to a class of Diophantine equations connected to the problem of determining ordered n-tuples of positive integers satisfying the property that their sum is equal to their product. An examination of the use of Binary Search Trees in implementing the algorithm into a working program is given. In addition an application of the algorithm for searching possible extra exceptional values of the equal-sum-product problem is explored after demonstrating a link between these numbers and the Sophie Germain primes."},"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":"1311.3874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-15T15:20:21Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"97b2e9822e0a274a0ded051d3e3fc59244e3085ff19e503e624ef827dae5bca2","abstract_canon_sha256":"1056fc325b7e189216730cc5cae0559ab4a6080e4601151912809a9865ef1141"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:02.818683Z","signature_b64":"dIKe1UpvCT7wuukYs2BggvyEdXNb6yakjFUKQ3/WyK74nd1fG/GUDvHAU5tcx0GsEoKRHgahNWBgkSMtN8JSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eab7c6a5f15acbed9bc9bc9285104ae3f11ecb795d67129d3a4a8eb5efac6fcf","last_reissued_at":"2026-05-18T03:07:02.818274Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:02.818274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algorithm to Solve the Equal-Sum-Product Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"C. D. Evans, M. A. Nyblom","submitted_at":"2013-11-15T15:20:21Z","abstract_excerpt":"A recursive algorithm is constructed which finds all solutions to a class of Diophantine equations connected to the problem of determining ordered n-tuples of positive integers satisfying the property that their sum is equal to their product. An examination of the use of Binary Search Trees in implementing the algorithm into a working program is given. In addition an application of the algorithm for searching possible extra exceptional values of the equal-sum-product problem is explored after demonstrating a link between these numbers and the Sophie Germain primes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3874","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":"1311.3874","created_at":"2026-05-18T03:07:02.818338+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.3874v1","created_at":"2026-05-18T03:07:02.818338+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3874","created_at":"2026-05-18T03:07:02.818338+00:00"},{"alias_kind":"pith_short_12","alias_value":"5K34NJPRLLF6","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5K34NJPRLLF63G6J","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5K34NJPR","created_at":"2026-05-18T12:27:34.582898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.03235","citing_title":"Bioperational Multisets in Various Semi-rings","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5K34NJPRLLF63G6JXSJIKECK4P","json":"https://pith.science/pith/5K34NJPRLLF63G6JXSJIKECK4P.json","graph_json":"https://pith.science/api/pith-number/5K34NJPRLLF63G6JXSJIKECK4P/graph.json","events_json":"https://pith.science/api/pith-number/5K34NJPRLLF63G6JXSJIKECK4P/events.json","paper":"https://pith.science/paper/5K34NJPR"},"agent_actions":{"view_html":"https://pith.science/pith/5K34NJPRLLF63G6JXSJIKECK4P","download_json":"https://pith.science/pith/5K34NJPRLLF63G6JXSJIKECK4P.json","view_paper":"https://pith.science/paper/5K34NJPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.3874&json=true","fetch_graph":"https://pith.science/api/pith-number/5K34NJPRLLF63G6JXSJIKECK4P/graph.json","fetch_events":"https://pith.science/api/pith-number/5K34NJPRLLF63G6JXSJIKECK4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5K34NJPRLLF63G6JXSJIKECK4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5K34NJPRLLF63G6JXSJIKECK4P/action/storage_attestation","attest_author":"https://pith.science/pith/5K34NJPRLLF63G6JXSJIKECK4P/action/author_attestation","sign_citation":"https://pith.science/pith/5K34NJPRLLF63G6JXSJIKECK4P/action/citation_signature","submit_replication":"https://pith.science/pith/5K34NJPRLLF63G6JXSJIKECK4P/action/replication_record"}},"created_at":"2026-05-18T03:07:02.818338+00:00","updated_at":"2026-05-18T03:07:02.818338+00:00"}