{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4WSHMFTHOI6ZET3YN2MIKOJXSW","short_pith_number":"pith:4WSHMFTH","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"},"canonical_sha256":"e5a4761667723d924f786e9885393795887fbf1035e7bba2b0b8f3440f824b4c","source":{"kind":"arxiv","id":"1708.08932","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.08932","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"arxiv_version","alias_value":"1708.08932v2","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08932","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"pith_short_12","alias_value":"4WSHMFTHOI6Z","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4WSHMFTHOI6ZET3Y","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4WSHMFTH","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4WSHMFTHOI6ZET3YN2MIKOJXSW","target":"record","payload":{"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"},"canonical_sha256":"e5a4761667723d924f786e9885393795887fbf1035e7bba2b0b8f3440f824b4c","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"},"source_kind":"arxiv","source_id":"1708.08932","source_version":2,"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-18T00:21:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KEJNIvHYbx81ZsKf/loKeNsIVx9rDOtQuU+3MLLfW176NtF03/Fzac0n8N48ZLCUKHMGmINJwrbLiu8eTHCQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:23:22.144852Z"},"content_sha256":"1ac2f6fa9c1b7b7eacaf3a8bd46fdff1d561716818a1e68e50f516f4fe6d2032","schema_version":"1.0","event_id":"sha256:1ac2f6fa9c1b7b7eacaf3a8bd46fdff1d561716818a1e68e50f516f4fe6d2032"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4WSHMFTHOI6ZET3YN2MIKOJXSW","target":"graph","payload":{"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"},"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-18T00:21:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZAVz4HmoDpq4MsWoBwQxpFvdhgZB7ra2UxMWNUaApVsPLqRaCZ70GH3se81P6hBpSQgBrGxEi/MddEOddjN4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:23:22.145463Z"},"content_sha256":"75656299a063001b5a5af4f0d12a1176a20f51505f3a72ba8df1247979d7a5ff","schema_version":"1.0","event_id":"sha256:75656299a063001b5a5af4f0d12a1176a20f51505f3a72ba8df1247979d7a5ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4WSHMFTHOI6ZET3YN2MIKOJXSW/bundle.json","state_url":"https://pith.science/pith/4WSHMFTHOI6ZET3YN2MIKOJXSW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4WSHMFTHOI6ZET3YN2MIKOJXSW/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-05-29T16:23:22Z","links":{"resolver":"https://pith.science/pith/4WSHMFTHOI6ZET3YN2MIKOJXSW","bundle":"https://pith.science/pith/4WSHMFTHOI6ZET3YN2MIKOJXSW/bundle.json","state":"https://pith.science/pith/4WSHMFTHOI6ZET3YN2MIKOJXSW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4WSHMFTHOI6ZET3YN2MIKOJXSW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4WSHMFTHOI6ZET3YN2MIKOJXSW","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":"eb09c296adb0b3b2a94ec7d80699ef8e0b483f79e28a351e1023fe1d91ee9056","cross_cats_sorted":["cs.DS","physics.comp-ph","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2017-08-29T18:00:02Z","title_canon_sha256":"25afc4e367578aa7f071106a9426f0965d5c0c6ff2c9e7dab273d2548bd94249"},"schema_version":"1.0","source":{"id":"1708.08932","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.08932","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"arxiv_version","alias_value":"1708.08932v2","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08932","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"pith_short_12","alias_value":"4WSHMFTHOI6Z","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4WSHMFTHOI6ZET3Y","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4WSHMFTH","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:75656299a063001b5a5af4f0d12a1176a20f51505f3a72ba8df1247979d7a5ff","target":"graph","created_at":"2026-05-18T00:21:46Z","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":"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","authors_text":"Andrei E. Ruckenstein, Claudio Chamon, Eduardo R. Mucciolo, Stefanos Kourtis, Zhi-Cheng Yang","cross_cats":["cs.DS","physics.comp-ph","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2017-08-29T18:00:02Z","title":"Tensor network method for reversible classical computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08932","kind":"arxiv","version":2},"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:1ac2f6fa9c1b7b7eacaf3a8bd46fdff1d561716818a1e68e50f516f4fe6d2032","target":"record","created_at":"2026-05-18T00:21:46Z","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":"eb09c296adb0b3b2a94ec7d80699ef8e0b483f79e28a351e1023fe1d91ee9056","cross_cats_sorted":["cs.DS","physics.comp-ph","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2017-08-29T18:00:02Z","title_canon_sha256":"25afc4e367578aa7f071106a9426f0965d5c0c6ff2c9e7dab273d2548bd94249"},"schema_version":"1.0","source":{"id":"1708.08932","kind":"arxiv","version":2}},"canonical_sha256":"e5a4761667723d924f786e9885393795887fbf1035e7bba2b0b8f3440f824b4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5a4761667723d924f786e9885393795887fbf1035e7bba2b0b8f3440f824b4c","first_computed_at":"2026-05-18T00:21:46.149978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:46.149978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KL0mOBW1p/7jjcd82uKfFir56AJGwgyYgVnpPHnX0D9gCZgsJr1RkhqxambCjNoHC8qv98nHFD5eeiWaipr1DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:46.150687Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.08932","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ac2f6fa9c1b7b7eacaf3a8bd46fdff1d561716818a1e68e50f516f4fe6d2032","sha256:75656299a063001b5a5af4f0d12a1176a20f51505f3a72ba8df1247979d7a5ff"],"state_sha256":"02d38a1827ab6f06e2ce0ea8dcde79e05f1b7dfda660357f2c7335ba01bc54f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/3Gyu7h0Qi4JomFWMoqYYMfnFEa/AXwEdv2jAcMUkbwAcgvd8O0sLU+Lbjrrpmh4lkKmvRz1GbV3GmGHOPOsCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T16:23:22.148937Z","bundle_sha256":"0c0ff1a3e5bc73d619b0950417c5bea72836b312c1cbd79dea2b62b8d8e35728"}}