{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YSHP7CGICGHPCDUJSN3PRY6UQC","short_pith_number":"pith:YSHP7CGI","canonical_record":{"source":{"id":"2606.11365","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-09T18:47:07Z","cross_cats_sorted":["cond-mat.other","math.IT"],"title_canon_sha256":"043bd5b1e0db173afad69ddbabecf6513b48baf4bafaa0f11fa36b291588cbde","abstract_canon_sha256":"32e755dd8bf4fd87e93fe01993ef2aaf654f0ea5560e53d4d74c8bfacfc93a67"},"schema_version":"1.0"},"canonical_sha256":"c48eff88c8118ef10e899376f8e3d4809f707171e156c6149ac7ce6139a4e83a","source":{"kind":"arxiv","id":"2606.11365","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.11365","created_at":"2026-06-11T00:08:21Z"},{"alias_kind":"arxiv_version","alias_value":"2606.11365v1","created_at":"2026-06-11T00:08:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11365","created_at":"2026-06-11T00:08:21Z"},{"alias_kind":"pith_short_12","alias_value":"YSHP7CGICGHP","created_at":"2026-06-11T00:08:21Z"},{"alias_kind":"pith_short_16","alias_value":"YSHP7CGICGHPCDUJ","created_at":"2026-06-11T00:08:21Z"},{"alias_kind":"pith_short_8","alias_value":"YSHP7CGI","created_at":"2026-06-11T00:08:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YSHP7CGICGHPCDUJSN3PRY6UQC","target":"record","payload":{"canonical_record":{"source":{"id":"2606.11365","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-09T18:47:07Z","cross_cats_sorted":["cond-mat.other","math.IT"],"title_canon_sha256":"043bd5b1e0db173afad69ddbabecf6513b48baf4bafaa0f11fa36b291588cbde","abstract_canon_sha256":"32e755dd8bf4fd87e93fe01993ef2aaf654f0ea5560e53d4d74c8bfacfc93a67"},"schema_version":"1.0"},"canonical_sha256":"c48eff88c8118ef10e899376f8e3d4809f707171e156c6149ac7ce6139a4e83a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T00:08:21.823897Z","signature_b64":"2z9ZJ0NeB8Spoyv/n0pXegDa2UogCoP2+AFXvLJkDdlmWTdAiMYtG2bOF/55AOvRyT+vQDxidqPSwJgTnqDNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c48eff88c8118ef10e899376f8e3d4809f707171e156c6149ac7ce6139a4e83a","last_reissued_at":"2026-06-11T00:08:21.823158Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T00:08:21.823158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.11365","source_version":1,"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-06-11T00:08:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NAKTFK4iTWIScuoizSfrFM3jiR8BFybqidH6gDaDHxhBYFMiY7QKvi9EnjdiyEj+fK9v5O6qLq+H4/1utwfsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T01:40:28.766257Z"},"content_sha256":"90261b9c7a345cdc23c23997e940c952725afabb82e03d71ff0ff6a15a3c2e97","schema_version":"1.0","event_id":"sha256:90261b9c7a345cdc23c23997e940c952725afabb82e03d71ff0ff6a15a3c2e97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YSHP7CGICGHPCDUJSN3PRY6UQC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Color-Rule-Function Encoding for Combinatorial Memory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.other","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Khitun","submitted_at":"2026-06-09T18:47:07Z","abstract_excerpt":"Combinatorial memory is a class of memory in which information is encoded in the set of paths through a structured mesh. In this work, we introduce a systematic encoding framework, referred to as the Color-Rule-Function (CRF) approach, for representing information in combinatorial memory. The method consists of four key steps: selecting a sequence of paths in the mesh, assigning values (e.g., colors) to each cell, defining a set of rules based on the values encountered along each path, and constructing a Boolean function that determines the state of each path. . The coding procedure is illustr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11365","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.11365/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-11T00:08:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CeqaBvrVvSe1sEppUAJvmliHq6BZ4yx00R/4rQ5uYWCG+P6SGiMOPEM1BpXm50ReXJlOHKSEwAozyHs/UiEBAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T01:40:28.766653Z"},"content_sha256":"9b80d701688e19dcee88d56836802c94953f6d7d996e318bf4a5c58e61f0c263","schema_version":"1.0","event_id":"sha256:9b80d701688e19dcee88d56836802c94953f6d7d996e318bf4a5c58e61f0c263"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YSHP7CGICGHPCDUJSN3PRY6UQC/bundle.json","state_url":"https://pith.science/pith/YSHP7CGICGHPCDUJSN3PRY6UQC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YSHP7CGICGHPCDUJSN3PRY6UQC/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-06-27T01:40:28Z","links":{"resolver":"https://pith.science/pith/YSHP7CGICGHPCDUJSN3PRY6UQC","bundle":"https://pith.science/pith/YSHP7CGICGHPCDUJSN3PRY6UQC/bundle.json","state":"https://pith.science/pith/YSHP7CGICGHPCDUJSN3PRY6UQC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YSHP7CGICGHPCDUJSN3PRY6UQC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YSHP7CGICGHPCDUJSN3PRY6UQC","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":"32e755dd8bf4fd87e93fe01993ef2aaf654f0ea5560e53d4d74c8bfacfc93a67","cross_cats_sorted":["cond-mat.other","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-09T18:47:07Z","title_canon_sha256":"043bd5b1e0db173afad69ddbabecf6513b48baf4bafaa0f11fa36b291588cbde"},"schema_version":"1.0","source":{"id":"2606.11365","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.11365","created_at":"2026-06-11T00:08:21Z"},{"alias_kind":"arxiv_version","alias_value":"2606.11365v1","created_at":"2026-06-11T00:08:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11365","created_at":"2026-06-11T00:08:21Z"},{"alias_kind":"pith_short_12","alias_value":"YSHP7CGICGHP","created_at":"2026-06-11T00:08:21Z"},{"alias_kind":"pith_short_16","alias_value":"YSHP7CGICGHPCDUJ","created_at":"2026-06-11T00:08:21Z"},{"alias_kind":"pith_short_8","alias_value":"YSHP7CGI","created_at":"2026-06-11T00:08:21Z"}],"graph_snapshots":[{"event_id":"sha256:9b80d701688e19dcee88d56836802c94953f6d7d996e318bf4a5c58e61f0c263","target":"graph","created_at":"2026-06-11T00:08:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.11365/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Combinatorial memory is a class of memory in which information is encoded in the set of paths through a structured mesh. In this work, we introduce a systematic encoding framework, referred to as the Color-Rule-Function (CRF) approach, for representing information in combinatorial memory. The method consists of four key steps: selecting a sequence of paths in the mesh, assigning values (e.g., colors) to each cell, defining a set of rules based on the values encountered along each path, and constructing a Boolean function that determines the state of each path. . The coding procedure is illustr","authors_text":"Alexander Khitun","cross_cats":["cond-mat.other","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-09T18:47:07Z","title":"Color-Rule-Function Encoding for Combinatorial Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11365","kind":"arxiv","version":1},"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:90261b9c7a345cdc23c23997e940c952725afabb82e03d71ff0ff6a15a3c2e97","target":"record","created_at":"2026-06-11T00:08:21Z","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":"32e755dd8bf4fd87e93fe01993ef2aaf654f0ea5560e53d4d74c8bfacfc93a67","cross_cats_sorted":["cond-mat.other","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-09T18:47:07Z","title_canon_sha256":"043bd5b1e0db173afad69ddbabecf6513b48baf4bafaa0f11fa36b291588cbde"},"schema_version":"1.0","source":{"id":"2606.11365","kind":"arxiv","version":1}},"canonical_sha256":"c48eff88c8118ef10e899376f8e3d4809f707171e156c6149ac7ce6139a4e83a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c48eff88c8118ef10e899376f8e3d4809f707171e156c6149ac7ce6139a4e83a","first_computed_at":"2026-06-11T00:08:21.823158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T00:08:21.823158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2z9ZJ0NeB8Spoyv/n0pXegDa2UogCoP2+AFXvLJkDdlmWTdAiMYtG2bOF/55AOvRyT+vQDxidqPSwJgTnqDNCw==","signature_status":"signed_v1","signed_at":"2026-06-11T00:08:21.823897Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.11365","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90261b9c7a345cdc23c23997e940c952725afabb82e03d71ff0ff6a15a3c2e97","sha256:9b80d701688e19dcee88d56836802c94953f6d7d996e318bf4a5c58e61f0c263"],"state_sha256":"adf9bb23bb995b85c9eef48fe3ecf0ccb26798b4f42551f0b4f7841f7b1bfb1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rh2YineDqbNWaGzydjPNSQw0WyWtvF9p4FHwS+5HU/ajtgYvnWWmjKQ5yS8jLVddVpBQGyIgv5wA/Ma6IV7BDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T01:40:28.768623Z","bundle_sha256":"ceb4f7b9325c885cbcdb05ed1d1097a107e018338848e074688fb301cde249aa"}}