{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RJKYG2QUSDBEFU6BY2WTHMBP7S","short_pith_number":"pith:RJKYG2QU","schema_version":"1.0","canonical_sha256":"8a55836a1490c242d3c1c6ad33b02ffca092af265df84b66854d7a482d7a6e26","source":{"kind":"arxiv","id":"1802.00347","version":1},"attestation_state":"computed","paper":{"title":"Solving Minimum k-supplier in Adleman-Lipton model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Elizabeth D. Trippe, Hamid R. Arabnia, Karen Aguar, Saeid Safaei, Vahid Safaei","submitted_at":"2018-01-17T22:44:19Z","abstract_excerpt":"In this paper, we consider an algorithm for solving the minimum k supplier problem using the Adleman Lipton model. The procedure works in polynomial steps for the minimum k supplier problem of an undirected graph with n vertices, which is an NP hard combinatorial optimization problem."},"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":"1802.00347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-17T22:44:19Z","cross_cats_sorted":[],"title_canon_sha256":"9de544245b5a2afbea700d2ef65be30b78048d6c0a352cd0d6dddad914218456","abstract_canon_sha256":"e91606b2e8e08689a0db20e972428b101e669ef385208d59bc665eed82eddcb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:36.189257Z","signature_b64":"cRly9l7MnWg2LchlKGyuzt+FsfBeUVLfT6a3Ib/q60EIGGCTZHbB2YXIPk2AfhRCmXdZ3Gh2FgEWurEsNTZ3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a55836a1490c242d3c1c6ad33b02ffca092af265df84b66854d7a482d7a6e26","last_reissued_at":"2026-05-18T00:24:36.188885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:36.188885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Minimum k-supplier in Adleman-Lipton model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Elizabeth D. Trippe, Hamid R. Arabnia, Karen Aguar, Saeid Safaei, Vahid Safaei","submitted_at":"2018-01-17T22:44:19Z","abstract_excerpt":"In this paper, we consider an algorithm for solving the minimum k supplier problem using the Adleman Lipton model. The procedure works in polynomial steps for the minimum k supplier problem of an undirected graph with n vertices, which is an NP hard combinatorial optimization problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00347","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":"1802.00347","created_at":"2026-05-18T00:24:36.188952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.00347v1","created_at":"2026-05-18T00:24:36.188952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00347","created_at":"2026-05-18T00:24:36.188952+00:00"},{"alias_kind":"pith_short_12","alias_value":"RJKYG2QUSDBE","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RJKYG2QUSDBEFU6B","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RJKYG2QU","created_at":"2026-05-18T12:32:50.500415+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/RJKYG2QUSDBEFU6BY2WTHMBP7S","json":"https://pith.science/pith/RJKYG2QUSDBEFU6BY2WTHMBP7S.json","graph_json":"https://pith.science/api/pith-number/RJKYG2QUSDBEFU6BY2WTHMBP7S/graph.json","events_json":"https://pith.science/api/pith-number/RJKYG2QUSDBEFU6BY2WTHMBP7S/events.json","paper":"https://pith.science/paper/RJKYG2QU"},"agent_actions":{"view_html":"https://pith.science/pith/RJKYG2QUSDBEFU6BY2WTHMBP7S","download_json":"https://pith.science/pith/RJKYG2QUSDBEFU6BY2WTHMBP7S.json","view_paper":"https://pith.science/paper/RJKYG2QU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.00347&json=true","fetch_graph":"https://pith.science/api/pith-number/RJKYG2QUSDBEFU6BY2WTHMBP7S/graph.json","fetch_events":"https://pith.science/api/pith-number/RJKYG2QUSDBEFU6BY2WTHMBP7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RJKYG2QUSDBEFU6BY2WTHMBP7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RJKYG2QUSDBEFU6BY2WTHMBP7S/action/storage_attestation","attest_author":"https://pith.science/pith/RJKYG2QUSDBEFU6BY2WTHMBP7S/action/author_attestation","sign_citation":"https://pith.science/pith/RJKYG2QUSDBEFU6BY2WTHMBP7S/action/citation_signature","submit_replication":"https://pith.science/pith/RJKYG2QUSDBEFU6BY2WTHMBP7S/action/replication_record"}},"created_at":"2026-05-18T00:24:36.188952+00:00","updated_at":"2026-05-18T00:24:36.188952+00:00"}