{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:LA53PO6A4NTTLWL4ITSZIXVH7J","short_pith_number":"pith:LA53PO6A","canonical_record":{"source":{"id":"2307.15453","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-07-28T10:11:01Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"d0f64a492ad1d6145a9b0fc5bbc05c11889fd88cdba0487dc5c18d971d0aab47","abstract_canon_sha256":"cf5b55d516a9ce6196e27fb4da74bc134761e9eadb479ed341e288dd87149ca6"},"schema_version":"1.0"},"canonical_sha256":"583bb7bbc0e36735d97c44e5945ea7fa6225f7153698a7933811f82d18517dc7","source":{"kind":"arxiv","id":"2307.15453","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.15453","created_at":"2026-07-05T06:49:24Z"},{"alias_kind":"arxiv_version","alias_value":"2307.15453v2","created_at":"2026-07-05T06:49:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.15453","created_at":"2026-07-05T06:49:24Z"},{"alias_kind":"pith_short_12","alias_value":"LA53PO6A4NTT","created_at":"2026-07-05T06:49:24Z"},{"alias_kind":"pith_short_16","alias_value":"LA53PO6A4NTTLWL4","created_at":"2026-07-05T06:49:24Z"},{"alias_kind":"pith_short_8","alias_value":"LA53PO6A","created_at":"2026-07-05T06:49:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:LA53PO6A4NTTLWL4ITSZIXVH7J","target":"record","payload":{"canonical_record":{"source":{"id":"2307.15453","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-07-28T10:11:01Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"d0f64a492ad1d6145a9b0fc5bbc05c11889fd88cdba0487dc5c18d971d0aab47","abstract_canon_sha256":"cf5b55d516a9ce6196e27fb4da74bc134761e9eadb479ed341e288dd87149ca6"},"schema_version":"1.0"},"canonical_sha256":"583bb7bbc0e36735d97c44e5945ea7fa6225f7153698a7933811f82d18517dc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:49:24.465792Z","signature_b64":"rBAUFhbwdzhT0tROYJS51mH/IflisYKuvQ/9qOvoBQVkWbugDnlmbmIK0p6yBhMjhF+Fj6Dv3eOl27sWmATqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"583bb7bbc0e36735d97c44e5945ea7fa6225f7153698a7933811f82d18517dc7","last_reissued_at":"2026-07-05T06:49:24.465336Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:49:24.465336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.15453","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-07-05T06:49:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ivsV6SlcOIPHTeobe11D/vlvlsdzcHE4WA1bB+IAfz0wVOsl2NO6OGVsBYrbuYSBTWDoD4dWsOaazcuCGyCQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T03:32:12.567834Z"},"content_sha256":"bfe96a74a5f5bdd9f86be446d63f1d7789e3ba0bec9f1b38ada88ad8994532d1","schema_version":"1.0","event_id":"sha256:bfe96a74a5f5bdd9f86be446d63f1d7789e3ba0bec9f1b38ada88ad8994532d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:LA53PO6A4NTTLWL4ITSZIXVH7J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From Probabilistic Programming to Complexity-based Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Giovanni Sileno, Jean-Louis Dessalles","submitted_at":"2023-07-28T10:11:01Z","abstract_excerpt":"The paper presents the main characteristics and a preliminary implementation of a novel computational framework named CompLog. Inspired by probabilistic programming systems like ProbLog, CompLog builds upon the inferential mechanisms proposed by Simplicity Theory, relying on the computation of two Kolmogorov complexities (here implemented as min-path searches via ASP programs) rather than probabilistic inference. The proposed system enables users to compute ex-post and ex-ante measures of unexpectedness of a certain situation, mapping respectively to posterior and prior subjective probabilitie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.15453","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.15453/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-05T06:49:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gUik4WQJbNkv4cWB79fePy99C+flRHJPRJgmoRoIWmYmI2CcMwydQfhA3e+wLIeIcsFIHHMkKhHleuuPlTr9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T03:32:12.568504Z"},"content_sha256":"502e2a8cd8ce3ee1ee27845becbab99fa76e2673c65eba2370ed5e842aaadfeb","schema_version":"1.0","event_id":"sha256:502e2a8cd8ce3ee1ee27845becbab99fa76e2673c65eba2370ed5e842aaadfeb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LA53PO6A4NTTLWL4ITSZIXVH7J/bundle.json","state_url":"https://pith.science/pith/LA53PO6A4NTTLWL4ITSZIXVH7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LA53PO6A4NTTLWL4ITSZIXVH7J/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-19T03:32:12Z","links":{"resolver":"https://pith.science/pith/LA53PO6A4NTTLWL4ITSZIXVH7J","bundle":"https://pith.science/pith/LA53PO6A4NTTLWL4ITSZIXVH7J/bundle.json","state":"https://pith.science/pith/LA53PO6A4NTTLWL4ITSZIXVH7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LA53PO6A4NTTLWL4ITSZIXVH7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:LA53PO6A4NTTLWL4ITSZIXVH7J","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":"cf5b55d516a9ce6196e27fb4da74bc134761e9eadb479ed341e288dd87149ca6","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-07-28T10:11:01Z","title_canon_sha256":"d0f64a492ad1d6145a9b0fc5bbc05c11889fd88cdba0487dc5c18d971d0aab47"},"schema_version":"1.0","source":{"id":"2307.15453","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.15453","created_at":"2026-07-05T06:49:24Z"},{"alias_kind":"arxiv_version","alias_value":"2307.15453v2","created_at":"2026-07-05T06:49:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.15453","created_at":"2026-07-05T06:49:24Z"},{"alias_kind":"pith_short_12","alias_value":"LA53PO6A4NTT","created_at":"2026-07-05T06:49:24Z"},{"alias_kind":"pith_short_16","alias_value":"LA53PO6A4NTTLWL4","created_at":"2026-07-05T06:49:24Z"},{"alias_kind":"pith_short_8","alias_value":"LA53PO6A","created_at":"2026-07-05T06:49:24Z"}],"graph_snapshots":[{"event_id":"sha256:502e2a8cd8ce3ee1ee27845becbab99fa76e2673c65eba2370ed5e842aaadfeb","target":"graph","created_at":"2026-07-05T06:49:24Z","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/2307.15453/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The paper presents the main characteristics and a preliminary implementation of a novel computational framework named CompLog. Inspired by probabilistic programming systems like ProbLog, CompLog builds upon the inferential mechanisms proposed by Simplicity Theory, relying on the computation of two Kolmogorov complexities (here implemented as min-path searches via ASP programs) rather than probabilistic inference. The proposed system enables users to compute ex-post and ex-ante measures of unexpectedness of a certain situation, mapping respectively to posterior and prior subjective probabilitie","authors_text":"Giovanni Sileno, Jean-Louis Dessalles","cross_cats":["cs.CL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-07-28T10:11:01Z","title":"From Probabilistic Programming to Complexity-based Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.15453","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:bfe96a74a5f5bdd9f86be446d63f1d7789e3ba0bec9f1b38ada88ad8994532d1","target":"record","created_at":"2026-07-05T06:49:24Z","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":"cf5b55d516a9ce6196e27fb4da74bc134761e9eadb479ed341e288dd87149ca6","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-07-28T10:11:01Z","title_canon_sha256":"d0f64a492ad1d6145a9b0fc5bbc05c11889fd88cdba0487dc5c18d971d0aab47"},"schema_version":"1.0","source":{"id":"2307.15453","kind":"arxiv","version":2}},"canonical_sha256":"583bb7bbc0e36735d97c44e5945ea7fa6225f7153698a7933811f82d18517dc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"583bb7bbc0e36735d97c44e5945ea7fa6225f7153698a7933811f82d18517dc7","first_computed_at":"2026-07-05T06:49:24.465336Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:49:24.465336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rBAUFhbwdzhT0tROYJS51mH/IflisYKuvQ/9qOvoBQVkWbugDnlmbmIK0p6yBhMjhF+Fj6Dv3eOl27sWmATqCg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:49:24.465792Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.15453","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfe96a74a5f5bdd9f86be446d63f1d7789e3ba0bec9f1b38ada88ad8994532d1","sha256:502e2a8cd8ce3ee1ee27845becbab99fa76e2673c65eba2370ed5e842aaadfeb"],"state_sha256":"8ff9f7308468a43b008675b940df31774b343d0b82598234cb20e61ed010da71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9SeX8Dri5o/gLBwineLT0gdryXV3WMJwmLmPhgTCQyP4lQx2gA8tiLy2E3DBzmDBR2MAboZacwsCNhguKDcEAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T03:32:12.583175Z","bundle_sha256":"0c14fa42570a6c8a4f672ef98e60cadbd17734ec765e64cf46b902ac42c8d16d"}}