{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:4ECVR6HSKWQEC3JR4PLTEAJRAX","short_pith_number":"pith:4ECVR6HS","canonical_record":{"source":{"id":"0710.3861","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-10-20T18:00:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"62f74570843b3a36d69d484a881a60e21eb086f3c20fe5217b8651a0f1db0b37","abstract_canon_sha256":"3bd14292fcdd20c2f0863dd8c4946af22d9198c6b431e1c2bfb71a60a71a25e3"},"schema_version":"1.0"},"canonical_sha256":"e10558f8f255a0416d31e3d732013105fee4e384c943dade675903e53d3fc95f","source":{"kind":"arxiv","id":"0710.3861","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0710.3861","created_at":"2026-07-04T15:15:36Z"},{"alias_kind":"arxiv_version","alias_value":"0710.3861v5","created_at":"2026-07-04T15:15:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.3861","created_at":"2026-07-04T15:15:36Z"},{"alias_kind":"pith_short_12","alias_value":"4ECVR6HSKWQE","created_at":"2026-07-04T15:15:36Z"},{"alias_kind":"pith_short_16","alias_value":"4ECVR6HSKWQEC3JR","created_at":"2026-07-04T15:15:36Z"},{"alias_kind":"pith_short_8","alias_value":"4ECVR6HS","created_at":"2026-07-04T15:15:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:4ECVR6HSKWQEC3JR4PLTEAJRAX","target":"record","payload":{"canonical_record":{"source":{"id":"0710.3861","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-10-20T18:00:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"62f74570843b3a36d69d484a881a60e21eb086f3c20fe5217b8651a0f1db0b37","abstract_canon_sha256":"3bd14292fcdd20c2f0863dd8c4946af22d9198c6b431e1c2bfb71a60a71a25e3"},"schema_version":"1.0"},"canonical_sha256":"e10558f8f255a0416d31e3d732013105fee4e384c943dade675903e53d3fc95f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:15:36.881277Z","signature_b64":"oAC2loJIReCHW5qhoPIsSVDVEIRzXf5+zgHj9gOH/FKUU3a60zDpzk5ExOxyAOenbG3BIiu7b5T1V7W0WgTjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e10558f8f255a0416d31e3d732013105fee4e384c943dade675903e53d3fc95f","last_reissued_at":"2026-07-04T15:15:36.880865Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:15:36.880865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0710.3861","source_version":5,"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-07-04T15:15:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H0mzPPex326hqkaGJhRfg0Tv+JsdtPFPNcARuQmDZq0kaE7YtrGOk0ZO+1HBT06HFIsRJpZx1HmVkGappXftBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T03:07:42.647773Z"},"content_sha256":"431cae62dc3a8b8e82157d27a99c2cf3d400ac05971bcd9a4201af98b0a42a5e","schema_version":"1.0","event_id":"sha256:431cae62dc3a8b8e82157d27a99c2cf3d400ac05971bcd9a4201af98b0a42a5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:4ECVR6HSKWQEC3JR4PLTEAJRAX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal encoding on discrete lattice with translational invariant constrains using statistical algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jarek Duda","submitted_at":"2007-10-20T18:00:57Z","abstract_excerpt":"In this paper will be presented methodology of encoding information in valuations of discrete lattice with some translational invariant constrains in asymptotically optimal way. The method is based on finding statistical description of such valuations and changing it into statistical algorithm, which allows to construct deterministically valuation with given statistics. Optimal statistics allow to generate valuations with uniform distribution - we get maximum information capacity this way. It will be shown that we can reach the optimum for one-dimensional models using maximal entropy random wa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.3861","kind":"arxiv","version":5},"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/0710.3861/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-07-04T15:15:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pBZ+HnJBKMCU7YVsXRuJdl9J9B0NTjFRH3vHQoftNvGBvz58DwnGPrx8Fz0zVjtVadD7/hsc2zu4GCEz5YwFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T03:07:42.648405Z"},"content_sha256":"38c44e1daa57ce4f0f4edb5e4d9d04d924fa20390322e519fe1a82eb0f663024","schema_version":"1.0","event_id":"sha256:38c44e1daa57ce4f0f4edb5e4d9d04d924fa20390322e519fe1a82eb0f663024"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ECVR6HSKWQEC3JR4PLTEAJRAX/bundle.json","state_url":"https://pith.science/pith/4ECVR6HSKWQEC3JR4PLTEAJRAX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ECVR6HSKWQEC3JR4PLTEAJRAX/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-08-24T03:07:42Z","links":{"resolver":"https://pith.science/pith/4ECVR6HSKWQEC3JR4PLTEAJRAX","bundle":"https://pith.science/pith/4ECVR6HSKWQEC3JR4PLTEAJRAX/bundle.json","state":"https://pith.science/pith/4ECVR6HSKWQEC3JR4PLTEAJRAX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ECVR6HSKWQEC3JR4PLTEAJRAX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:4ECVR6HSKWQEC3JR4PLTEAJRAX","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":"3bd14292fcdd20c2f0863dd8c4946af22d9198c6b431e1c2bfb71a60a71a25e3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-10-20T18:00:57Z","title_canon_sha256":"62f74570843b3a36d69d484a881a60e21eb086f3c20fe5217b8651a0f1db0b37"},"schema_version":"1.0","source":{"id":"0710.3861","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0710.3861","created_at":"2026-07-04T15:15:36Z"},{"alias_kind":"arxiv_version","alias_value":"0710.3861v5","created_at":"2026-07-04T15:15:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.3861","created_at":"2026-07-04T15:15:36Z"},{"alias_kind":"pith_short_12","alias_value":"4ECVR6HSKWQE","created_at":"2026-07-04T15:15:36Z"},{"alias_kind":"pith_short_16","alias_value":"4ECVR6HSKWQEC3JR","created_at":"2026-07-04T15:15:36Z"},{"alias_kind":"pith_short_8","alias_value":"4ECVR6HS","created_at":"2026-07-04T15:15:36Z"}],"graph_snapshots":[{"event_id":"sha256:38c44e1daa57ce4f0f4edb5e4d9d04d924fa20390322e519fe1a82eb0f663024","target":"graph","created_at":"2026-07-04T15:15:36Z","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/0710.3861/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper will be presented methodology of encoding information in valuations of discrete lattice with some translational invariant constrains in asymptotically optimal way. The method is based on finding statistical description of such valuations and changing it into statistical algorithm, which allows to construct deterministically valuation with given statistics. Optimal statistics allow to generate valuations with uniform distribution - we get maximum information capacity this way. It will be shown that we can reach the optimum for one-dimensional models using maximal entropy random wa","authors_text":"Jarek Duda","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-10-20T18:00:57Z","title":"Optimal encoding on discrete lattice with translational invariant constrains using statistical algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.3861","kind":"arxiv","version":5},"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:431cae62dc3a8b8e82157d27a99c2cf3d400ac05971bcd9a4201af98b0a42a5e","target":"record","created_at":"2026-07-04T15:15:36Z","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":"3bd14292fcdd20c2f0863dd8c4946af22d9198c6b431e1c2bfb71a60a71a25e3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-10-20T18:00:57Z","title_canon_sha256":"62f74570843b3a36d69d484a881a60e21eb086f3c20fe5217b8651a0f1db0b37"},"schema_version":"1.0","source":{"id":"0710.3861","kind":"arxiv","version":5}},"canonical_sha256":"e10558f8f255a0416d31e3d732013105fee4e384c943dade675903e53d3fc95f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e10558f8f255a0416d31e3d732013105fee4e384c943dade675903e53d3fc95f","first_computed_at":"2026-07-04T15:15:36.880865Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:15:36.880865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oAC2loJIReCHW5qhoPIsSVDVEIRzXf5+zgHj9gOH/FKUU3a60zDpzk5ExOxyAOenbG3BIiu7b5T1V7W0WgTjAQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:15:36.881277Z","signed_message":"canonical_sha256_bytes"},"source_id":"0710.3861","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:431cae62dc3a8b8e82157d27a99c2cf3d400ac05971bcd9a4201af98b0a42a5e","sha256:38c44e1daa57ce4f0f4edb5e4d9d04d924fa20390322e519fe1a82eb0f663024"],"state_sha256":"e907fdb962bed55f74063f2391c22ae7b16caf35521d45b85ab5785c474e2e60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sr8lodLr8B+pr1Ifrbv2diXYpTVn1qYuSO3tJxwl6wpWJmL/r1dt/4Ir+LmOzwXm3SJkfGhycEPwRI24JwhUAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-24T03:07:42.653915Z","bundle_sha256":"3c99a40a139150447485548323a9aad71aa1aff942071429c9a158e4c9f3fa6c"}}