{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4WSHMFTHOI6ZET3YN2MIKOJXSW","short_pith_number":"pith:4WSHMFTH","schema_version":"1.0","canonical_sha256":"e5a4761667723d924f786e9885393795887fbf1035e7bba2b0b8f3440f824b4c","source":{"kind":"arxiv","id":"1708.08932","version":2},"attestation_state":"computed","paper":{"title":"Tensor network method for reversible classical computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","physics.comp-ph","quant-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Andrei E. Ruckenstein, Claudio Chamon, Eduardo R. Mucciolo, Stefanos Kourtis, Zhi-Cheng Yang","submitted_at":"2017-08-29T18:00:02Z","abstract_excerpt":"We develop a tensor network technique that can solve universal reversible classical computational problems, formulated as vertex models on a square lattice [Nat. Commun. 8, 15303 (2017)]. By encoding the truth table of each vertex constraint in a tensor, the total number of solutions compatible with partial inputs/outputs at the boundary can be represented as the full contraction of a tensor network. We introduce an iterative compression-decimation (ICD) scheme that performs this contraction efficiently. The ICD algorithm first propagates local constraints to longer ranges via repeated contrac"},"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":"1708.08932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2017-08-29T18:00:02Z","cross_cats_sorted":["cs.DS","physics.comp-ph","quant-ph"],"title_canon_sha256":"25afc4e367578aa7f071106a9426f0965d5c0c6ff2c9e7dab273d2548bd94249","abstract_canon_sha256":"eb09c296adb0b3b2a94ec7d80699ef8e0b483f79e28a351e1023fe1d91ee9056"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:46.150687Z","signature_b64":"KL0mOBW1p/7jjcd82uKfFir56AJGwgyYgVnpPHnX0D9gCZgsJr1RkhqxambCjNoHC8qv98nHFD5eeiWaipr1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5a4761667723d924f786e9885393795887fbf1035e7bba2b0b8f3440f824b4c","last_reissued_at":"2026-05-18T00:21:46.149978Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:46.149978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tensor network method for reversible classical computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","physics.comp-ph","quant-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Andrei E. Ruckenstein, Claudio Chamon, Eduardo R. Mucciolo, Stefanos Kourtis, Zhi-Cheng Yang","submitted_at":"2017-08-29T18:00:02Z","abstract_excerpt":"We develop a tensor network technique that can solve universal reversible classical computational problems, formulated as vertex models on a square lattice [Nat. Commun. 8, 15303 (2017)]. By encoding the truth table of each vertex constraint in a tensor, the total number of solutions compatible with partial inputs/outputs at the boundary can be represented as the full contraction of a tensor network. We introduce an iterative compression-decimation (ICD) scheme that performs this contraction efficiently. The ICD algorithm first propagates local constraints to longer ranges via repeated contrac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08932","kind":"arxiv","version":2},"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":"1708.08932","created_at":"2026-05-18T00:21:46.150087+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.08932v2","created_at":"2026-05-18T00:21:46.150087+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08932","created_at":"2026-05-18T00:21:46.150087+00:00"},{"alias_kind":"pith_short_12","alias_value":"4WSHMFTHOI6Z","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4WSHMFTHOI6ZET3Y","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4WSHMFTH","created_at":"2026-05-18T12:31:00.734936+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/4WSHMFTHOI6ZET3YN2MIKOJXSW","json":"https://pith.science/pith/4WSHMFTHOI6ZET3YN2MIKOJXSW.json","graph_json":"https://pith.science/api/pith-number/4WSHMFTHOI6ZET3YN2MIKOJXSW/graph.json","events_json":"https://pith.science/api/pith-number/4WSHMFTHOI6ZET3YN2MIKOJXSW/events.json","paper":"https://pith.science/paper/4WSHMFTH"},"agent_actions":{"view_html":"https://pith.science/pith/4WSHMFTHOI6ZET3YN2MIKOJXSW","download_json":"https://pith.science/pith/4WSHMFTHOI6ZET3YN2MIKOJXSW.json","view_paper":"https://pith.science/paper/4WSHMFTH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.08932&json=true","fetch_graph":"https://pith.science/api/pith-number/4WSHMFTHOI6ZET3YN2MIKOJXSW/graph.json","fetch_events":"https://pith.science/api/pith-number/4WSHMFTHOI6ZET3YN2MIKOJXSW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4WSHMFTHOI6ZET3YN2MIKOJXSW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4WSHMFTHOI6ZET3YN2MIKOJXSW/action/storage_attestation","attest_author":"https://pith.science/pith/4WSHMFTHOI6ZET3YN2MIKOJXSW/action/author_attestation","sign_citation":"https://pith.science/pith/4WSHMFTHOI6ZET3YN2MIKOJXSW/action/citation_signature","submit_replication":"https://pith.science/pith/4WSHMFTHOI6ZET3YN2MIKOJXSW/action/replication_record"}},"created_at":"2026-05-18T00:21:46.150087+00:00","updated_at":"2026-05-18T00:21:46.150087+00:00"}