{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5K34NJPRLLF63G6JXSJIKECK4P","short_pith_number":"pith:5K34NJPR","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"},"canonical_sha256":"eab7c6a5f15acbed9bc9bc9285104ae3f11ecb795d67129d3a4a8eb5efac6fcf","source":{"kind":"arxiv","id":"1311.3874","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3874","created_at":"2026-05-18T03:07:02Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3874v1","created_at":"2026-05-18T03:07:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3874","created_at":"2026-05-18T03:07:02Z"},{"alias_kind":"pith_short_12","alias_value":"5K34NJPRLLF6","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5K34NJPRLLF63G6J","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5K34NJPR","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5K34NJPRLLF63G6JXSJIKECK4P","target":"record","payload":{"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"},"canonical_sha256":"eab7c6a5f15acbed9bc9bc9285104ae3f11ecb795d67129d3a4a8eb5efac6fcf","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"},"source_kind":"arxiv","source_id":"1311.3874","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:07:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/E5LgNKd9DcwmXLngdx0c2hM9bnQHUeOtSeQ3C5dkmulj1lmrH3+ajt/8ZvDmxMxpbdPALk5bhBUYcnrcH5kAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:28:59.484744Z"},"content_sha256":"e64f0547094f4311a1be8713dc082ec9032e3678ec364c0b030ced43c11ddf6a","schema_version":"1.0","event_id":"sha256:e64f0547094f4311a1be8713dc082ec9032e3678ec364c0b030ced43c11ddf6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5K34NJPRLLF63G6JXSJIKECK4P","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:07:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e+4E/u/Lb+O6IlcKPcoYUwOJOhjGs98c07IOOFV5UMYXLW7vkJzvcqZEJ5jI7lLXxlLlDqXnGjRTdvsFL+KeCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:28:59.485328Z"},"content_sha256":"9d819499173c034a3b0876b75d238c69ca036b8fc7f79ab3a2fa5e272f9bfd32","schema_version":"1.0","event_id":"sha256:9d819499173c034a3b0876b75d238c69ca036b8fc7f79ab3a2fa5e272f9bfd32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5K34NJPRLLF63G6JXSJIKECK4P/bundle.json","state_url":"https://pith.science/pith/5K34NJPRLLF63G6JXSJIKECK4P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5K34NJPRLLF63G6JXSJIKECK4P/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-16T10:28:59Z","links":{"resolver":"https://pith.science/pith/5K34NJPRLLF63G6JXSJIKECK4P","bundle":"https://pith.science/pith/5K34NJPRLLF63G6JXSJIKECK4P/bundle.json","state":"https://pith.science/pith/5K34NJPRLLF63G6JXSJIKECK4P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5K34NJPRLLF63G6JXSJIKECK4P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5K34NJPRLLF63G6JXSJIKECK4P","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1056fc325b7e189216730cc5cae0559ab4a6080e4601151912809a9865ef1141","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-15T15:20:21Z","title_canon_sha256":"97b2e9822e0a274a0ded051d3e3fc59244e3085ff19e503e624ef827dae5bca2"},"schema_version":"1.0","source":{"id":"1311.3874","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3874","created_at":"2026-05-18T03:07:02Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3874v1","created_at":"2026-05-18T03:07:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3874","created_at":"2026-05-18T03:07:02Z"},{"alias_kind":"pith_short_12","alias_value":"5K34NJPRLLF6","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5K34NJPRLLF63G6J","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5K34NJPR","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:9d819499173c034a3b0876b75d238c69ca036b8fc7f79ab3a2fa5e272f9bfd32","target":"graph","created_at":"2026-05-18T03:07:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"C. D. Evans, M. A. Nyblom","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-15T15:20:21Z","title":"An Algorithm to Solve the Equal-Sum-Product Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3874","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e64f0547094f4311a1be8713dc082ec9032e3678ec364c0b030ced43c11ddf6a","target":"record","created_at":"2026-05-18T03:07:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1056fc325b7e189216730cc5cae0559ab4a6080e4601151912809a9865ef1141","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-15T15:20:21Z","title_canon_sha256":"97b2e9822e0a274a0ded051d3e3fc59244e3085ff19e503e624ef827dae5bca2"},"schema_version":"1.0","source":{"id":"1311.3874","kind":"arxiv","version":1}},"canonical_sha256":"eab7c6a5f15acbed9bc9bc9285104ae3f11ecb795d67129d3a4a8eb5efac6fcf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eab7c6a5f15acbed9bc9bc9285104ae3f11ecb795d67129d3a4a8eb5efac6fcf","first_computed_at":"2026-05-18T03:07:02.818274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:02.818274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dIKe1UpvCT7wuukYs2BggvyEdXNb6yakjFUKQ3/WyK74nd1fG/GUDvHAU5tcx0GsEoKRHgahNWBgkSMtN8JSBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:02.818683Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.3874","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e64f0547094f4311a1be8713dc082ec9032e3678ec364c0b030ced43c11ddf6a","sha256:9d819499173c034a3b0876b75d238c69ca036b8fc7f79ab3a2fa5e272f9bfd32"],"state_sha256":"69850a08fca40dbeddcb611b84b9167adbe0afe4ae47fc0dadf0de2942a90a76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qY0VU7CwTXiEUpmTMgJJq/OurdlA9ROyCVkPaM1D/NhUiRDBVbkJemGz5PL+VuJeurMm9zK4Bxil7w3jLxCGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T10:28:59.502010Z","bundle_sha256":"b468196b94a8b44b2c22e0df346dca0bdf91ca418a27c887aeef49025a66fbe5"}}