{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FEWRYSZLM6DUSKHL3LHPKCIMJZ","short_pith_number":"pith:FEWRYSZL","schema_version":"1.0","canonical_sha256":"292d1c4b2b67874928ebdacef5090c4e5430669f55d23c545b7fe8361f104a42","source":{"kind":"arxiv","id":"1712.00651","version":1},"attestation_state":"computed","paper":{"title":"An optical solution for the set splitting problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Mihai Oltean","submitted_at":"2017-12-02T18:13:07Z","abstract_excerpt":"We describe here an optical device, based on time-delays, for solving the set splitting problem which is well-known NP-complete problem. The device has a graph-like structure and the light is traversing it from a start node to a destination node. All possible (potential) paths in the graph are generated and at the destination we will check which one satisfies completely the problem's constrains."},"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":"1712.00651","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2017-12-02T18:13:07Z","cross_cats_sorted":[],"title_canon_sha256":"b400efa309e97b9c3221376ade61baf5096a0b1fecfd64a45b35cb7c5f4b762b","abstract_canon_sha256":"d5455e85108335d86048273831cfcea0cd24500a7ef552158c00b3eab6d0a8ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:02.295977Z","signature_b64":"DPOsRiDG1sh8PR32tS/Pt4oo77F9g1zXu6tngFj+U1JcYyNtueJXhXGqjCSZ38BOFrs5jaNrK9evzOJgDwTEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"292d1c4b2b67874928ebdacef5090c4e5430669f55d23c545b7fe8361f104a42","last_reissued_at":"2026-05-18T00:29:02.295342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:02.295342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An optical solution for the set splitting problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Mihai Oltean","submitted_at":"2017-12-02T18:13:07Z","abstract_excerpt":"We describe here an optical device, based on time-delays, for solving the set splitting problem which is well-known NP-complete problem. The device has a graph-like structure and the light is traversing it from a start node to a destination node. All possible (potential) paths in the graph are generated and at the destination we will check which one satisfies completely the problem's constrains."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00651","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":"1712.00651","created_at":"2026-05-18T00:29:02.295444+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.00651v1","created_at":"2026-05-18T00:29:02.295444+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00651","created_at":"2026-05-18T00:29:02.295444+00:00"},{"alias_kind":"pith_short_12","alias_value":"FEWRYSZLM6DU","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FEWRYSZLM6DUSKHL","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FEWRYSZL","created_at":"2026-05-18T12:31:15.632608+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/FEWRYSZLM6DUSKHL3LHPKCIMJZ","json":"https://pith.science/pith/FEWRYSZLM6DUSKHL3LHPKCIMJZ.json","graph_json":"https://pith.science/api/pith-number/FEWRYSZLM6DUSKHL3LHPKCIMJZ/graph.json","events_json":"https://pith.science/api/pith-number/FEWRYSZLM6DUSKHL3LHPKCIMJZ/events.json","paper":"https://pith.science/paper/FEWRYSZL"},"agent_actions":{"view_html":"https://pith.science/pith/FEWRYSZLM6DUSKHL3LHPKCIMJZ","download_json":"https://pith.science/pith/FEWRYSZLM6DUSKHL3LHPKCIMJZ.json","view_paper":"https://pith.science/paper/FEWRYSZL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.00651&json=true","fetch_graph":"https://pith.science/api/pith-number/FEWRYSZLM6DUSKHL3LHPKCIMJZ/graph.json","fetch_events":"https://pith.science/api/pith-number/FEWRYSZLM6DUSKHL3LHPKCIMJZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FEWRYSZLM6DUSKHL3LHPKCIMJZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FEWRYSZLM6DUSKHL3LHPKCIMJZ/action/storage_attestation","attest_author":"https://pith.science/pith/FEWRYSZLM6DUSKHL3LHPKCIMJZ/action/author_attestation","sign_citation":"https://pith.science/pith/FEWRYSZLM6DUSKHL3LHPKCIMJZ/action/citation_signature","submit_replication":"https://pith.science/pith/FEWRYSZLM6DUSKHL3LHPKCIMJZ/action/replication_record"}},"created_at":"2026-05-18T00:29:02.295444+00:00","updated_at":"2026-05-18T00:29:02.295444+00:00"}