{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:54SO6VDOYSSE2Q4WKW6IKYRCO2","short_pith_number":"pith:54SO6VDO","canonical_record":{"source":{"id":"2212.11901","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-12-22T17:40:13Z","cross_cats_sorted":[],"title_canon_sha256":"231014c77beefcf7b5d2024b4eb7f843405d9751e184b190acefe8557ce479ff","abstract_canon_sha256":"2b6c2028ec940c562635e89c0d29fe8592f03e5d2ba733a5dc99a545caffc89d"},"schema_version":"1.0"},"canonical_sha256":"ef24ef546ec4a44d439655bc85622276b39c5f94352862928c080704ffed755f","source":{"kind":"arxiv","id":"2212.11901","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.11901","created_at":"2026-07-05T05:27:44Z"},{"alias_kind":"arxiv_version","alias_value":"2212.11901v1","created_at":"2026-07-05T05:27:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.11901","created_at":"2026-07-05T05:27:44Z"},{"alias_kind":"pith_short_12","alias_value":"54SO6VDOYSSE","created_at":"2026-07-05T05:27:44Z"},{"alias_kind":"pith_short_16","alias_value":"54SO6VDOYSSE2Q4W","created_at":"2026-07-05T05:27:44Z"},{"alias_kind":"pith_short_8","alias_value":"54SO6VDO","created_at":"2026-07-05T05:27:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:54SO6VDOYSSE2Q4WKW6IKYRCO2","target":"record","payload":{"canonical_record":{"source":{"id":"2212.11901","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-12-22T17:40:13Z","cross_cats_sorted":[],"title_canon_sha256":"231014c77beefcf7b5d2024b4eb7f843405d9751e184b190acefe8557ce479ff","abstract_canon_sha256":"2b6c2028ec940c562635e89c0d29fe8592f03e5d2ba733a5dc99a545caffc89d"},"schema_version":"1.0"},"canonical_sha256":"ef24ef546ec4a44d439655bc85622276b39c5f94352862928c080704ffed755f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:27:44.539257Z","signature_b64":"5+d2rMvj7clfhup21vtsD32TlAqNWgSyaEOBRq4pcogtchClafUPkcXBLW6cMpRnJCA8vlvOq0MOrMbjjFOUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef24ef546ec4a44d439655bc85622276b39c5f94352862928c080704ffed755f","last_reissued_at":"2026-07-05T05:27:44.538774Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:27:44.538774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.11901","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-07-05T05:27:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KWRevtB98fxQOqacHkeIHNqZ0kV8bQQB+8+nfeLqSVwPMmb+o+stOxO8pI2SkuV2ZG0yKTL9KtwEipWe324PBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T00:59:53.620968Z"},"content_sha256":"92866db2654abdba18d696d553fcab53b51c916c643fa3ef23478bd60ffe4b9d","schema_version":"1.0","event_id":"sha256:92866db2654abdba18d696d553fcab53b51c916c643fa3ef23478bd60ffe4b9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:54SO6VDOYSSE2Q4WKW6IKYRCO2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Machine Learning with Probabilistic Law Discovery: A Concise Introduction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alexander Demin, Denis Ponomaryov","submitted_at":"2022-12-22T17:40:13Z","abstract_excerpt":"Probabilistic Law Discovery (PLD) is a logic based Machine Learning method, which implements a variant of probabilistic rule learning. In several aspects, PLD is close to Decision Tree/Random Forest methods, but it differs significantly in how relevant rules are defined. The learning procedure of PLD solves the optimization problem related to the search for rules (called probabilistic laws), which have a minimal length and relatively high probability. At inference, ensembles of these rules are used for prediction. Probabilistic laws are human-readable and PLD based models are transparent and i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.11901","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/2212.11901/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-05T05:27:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y8nhAPnw/gcHjYD4gwpMCHlRZJKeD324n2LUnk/BNK+UKDen4MAg7x+Ae0MXH0h08PhdHB+C1dkReYraRzaAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T00:59:53.621345Z"},"content_sha256":"e9374dccf733386e457ca7ea37a266be999668c65879bc29fe1001aa06109cb1","schema_version":"1.0","event_id":"sha256:e9374dccf733386e457ca7ea37a266be999668c65879bc29fe1001aa06109cb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/54SO6VDOYSSE2Q4WKW6IKYRCO2/bundle.json","state_url":"https://pith.science/pith/54SO6VDOYSSE2Q4WKW6IKYRCO2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/54SO6VDOYSSE2Q4WKW6IKYRCO2/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-07-09T00:59:53Z","links":{"resolver":"https://pith.science/pith/54SO6VDOYSSE2Q4WKW6IKYRCO2","bundle":"https://pith.science/pith/54SO6VDOYSSE2Q4WKW6IKYRCO2/bundle.json","state":"https://pith.science/pith/54SO6VDOYSSE2Q4WKW6IKYRCO2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/54SO6VDOYSSE2Q4WKW6IKYRCO2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:54SO6VDOYSSE2Q4WKW6IKYRCO2","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":"2b6c2028ec940c562635e89c0d29fe8592f03e5d2ba733a5dc99a545caffc89d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-12-22T17:40:13Z","title_canon_sha256":"231014c77beefcf7b5d2024b4eb7f843405d9751e184b190acefe8557ce479ff"},"schema_version":"1.0","source":{"id":"2212.11901","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.11901","created_at":"2026-07-05T05:27:44Z"},{"alias_kind":"arxiv_version","alias_value":"2212.11901v1","created_at":"2026-07-05T05:27:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.11901","created_at":"2026-07-05T05:27:44Z"},{"alias_kind":"pith_short_12","alias_value":"54SO6VDOYSSE","created_at":"2026-07-05T05:27:44Z"},{"alias_kind":"pith_short_16","alias_value":"54SO6VDOYSSE2Q4W","created_at":"2026-07-05T05:27:44Z"},{"alias_kind":"pith_short_8","alias_value":"54SO6VDO","created_at":"2026-07-05T05:27:44Z"}],"graph_snapshots":[{"event_id":"sha256:e9374dccf733386e457ca7ea37a266be999668c65879bc29fe1001aa06109cb1","target":"graph","created_at":"2026-07-05T05:27:44Z","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/2212.11901/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Probabilistic Law Discovery (PLD) is a logic based Machine Learning method, which implements a variant of probabilistic rule learning. In several aspects, PLD is close to Decision Tree/Random Forest methods, but it differs significantly in how relevant rules are defined. The learning procedure of PLD solves the optimization problem related to the search for rules (called probabilistic laws), which have a minimal length and relatively high probability. At inference, ensembles of these rules are used for prediction. Probabilistic laws are human-readable and PLD based models are transparent and i","authors_text":"Alexander Demin, Denis Ponomaryov","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-12-22T17:40:13Z","title":"Machine Learning with Probabilistic Law Discovery: A Concise Introduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.11901","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:92866db2654abdba18d696d553fcab53b51c916c643fa3ef23478bd60ffe4b9d","target":"record","created_at":"2026-07-05T05:27:44Z","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":"2b6c2028ec940c562635e89c0d29fe8592f03e5d2ba733a5dc99a545caffc89d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-12-22T17:40:13Z","title_canon_sha256":"231014c77beefcf7b5d2024b4eb7f843405d9751e184b190acefe8557ce479ff"},"schema_version":"1.0","source":{"id":"2212.11901","kind":"arxiv","version":1}},"canonical_sha256":"ef24ef546ec4a44d439655bc85622276b39c5f94352862928c080704ffed755f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef24ef546ec4a44d439655bc85622276b39c5f94352862928c080704ffed755f","first_computed_at":"2026-07-05T05:27:44.538774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:27:44.538774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5+d2rMvj7clfhup21vtsD32TlAqNWgSyaEOBRq4pcogtchClafUPkcXBLW6cMpRnJCA8vlvOq0MOrMbjjFOUCA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:27:44.539257Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.11901","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92866db2654abdba18d696d553fcab53b51c916c643fa3ef23478bd60ffe4b9d","sha256:e9374dccf733386e457ca7ea37a266be999668c65879bc29fe1001aa06109cb1"],"state_sha256":"a51827f2b18f701388ab25d3ba5d2d4218e29fb0e3db83a184c345e848531af7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eWZkL1vIeiMHAYJjTKoQBUAZYYkrIU/0cq0N2SLFRvhALdqviFR/P0RNiIj1ZxukW4jsAUx8McPEWip+b/NZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T00:59:53.623515Z","bundle_sha256":"37c706db6a86ca4db6b7fed8f2edac89fc48a2886af6e215238517958468a8bb"}}