{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y7TKM55ECILHL66RUS4MGN22PD","short_pith_number":"pith:Y7TKM55E","schema_version":"1.0","canonical_sha256":"c7e6a677a4121675fbd1a4b8c3375a78c2d6dd144b3ca1113df45ba3c8f94aba","source":{"kind":"arxiv","id":"1705.01826","version":1},"attestation_state":"computed","paper":{"title":"Towards a Physical Oracle for the Partition Problem using Analogue Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Stefan Rass","submitted_at":"2017-05-04T13:11:47Z","abstract_excerpt":"Despite remarkable achievements in its practical tractability, the notorious class of NP-complete problems has been escaping all attempts to find a worst-case polynomial time-bound solution algorithms for any of them. The vast majority of work relies on Turing machines or equivalent models, all of which relate to digital computing. This raises the question of whether a computer that is (partly) non-digital could offer a new door towards an efficient solution. And indeed, the partition problem, which is another NP-complete sibling of the famous Boolean satisfiability problem SAT, might be open "},"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":"1705.01826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-05-04T13:11:47Z","cross_cats_sorted":[],"title_canon_sha256":"a7330953a80b883f09de0d7056d33ad852072fa8c36ed51e68b134aaa0a9de51","abstract_canon_sha256":"ad9b23e0b17b10da030878e0ff2b5193578cb1c9737aeb7a1d359b4877208308"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:02.234185Z","signature_b64":"aQt9sO27y/v9SxPY8UOfpOpyhY5rTB8+pak+t+4VM/UG2RxAenQrxcuS+uApsYVmaRt7YX/yQHM1YGxG2RQkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7e6a677a4121675fbd1a4b8c3375a78c2d6dd144b3ca1113df45ba3c8f94aba","last_reissued_at":"2026-05-18T00:45:02.233706Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:02.233706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards a Physical Oracle for the Partition Problem using Analogue Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Stefan Rass","submitted_at":"2017-05-04T13:11:47Z","abstract_excerpt":"Despite remarkable achievements in its practical tractability, the notorious class of NP-complete problems has been escaping all attempts to find a worst-case polynomial time-bound solution algorithms for any of them. The vast majority of work relies on Turing machines or equivalent models, all of which relate to digital computing. This raises the question of whether a computer that is (partly) non-digital could offer a new door towards an efficient solution. And indeed, the partition problem, which is another NP-complete sibling of the famous Boolean satisfiability problem SAT, might be open "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01826","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":"1705.01826","created_at":"2026-05-18T00:45:02.233775+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.01826v1","created_at":"2026-05-18T00:45:02.233775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01826","created_at":"2026-05-18T00:45:02.233775+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y7TKM55ECILH","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y7TKM55ECILHL66R","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y7TKM55E","created_at":"2026-05-18T12:31:56.362134+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/Y7TKM55ECILHL66RUS4MGN22PD","json":"https://pith.science/pith/Y7TKM55ECILHL66RUS4MGN22PD.json","graph_json":"https://pith.science/api/pith-number/Y7TKM55ECILHL66RUS4MGN22PD/graph.json","events_json":"https://pith.science/api/pith-number/Y7TKM55ECILHL66RUS4MGN22PD/events.json","paper":"https://pith.science/paper/Y7TKM55E"},"agent_actions":{"view_html":"https://pith.science/pith/Y7TKM55ECILHL66RUS4MGN22PD","download_json":"https://pith.science/pith/Y7TKM55ECILHL66RUS4MGN22PD.json","view_paper":"https://pith.science/paper/Y7TKM55E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.01826&json=true","fetch_graph":"https://pith.science/api/pith-number/Y7TKM55ECILHL66RUS4MGN22PD/graph.json","fetch_events":"https://pith.science/api/pith-number/Y7TKM55ECILHL66RUS4MGN22PD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y7TKM55ECILHL66RUS4MGN22PD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y7TKM55ECILHL66RUS4MGN22PD/action/storage_attestation","attest_author":"https://pith.science/pith/Y7TKM55ECILHL66RUS4MGN22PD/action/author_attestation","sign_citation":"https://pith.science/pith/Y7TKM55ECILHL66RUS4MGN22PD/action/citation_signature","submit_replication":"https://pith.science/pith/Y7TKM55ECILHL66RUS4MGN22PD/action/replication_record"}},"created_at":"2026-05-18T00:45:02.233775+00:00","updated_at":"2026-05-18T00:45:02.233775+00:00"}