{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:62UPGVFQUC6BNNTRLKOPMRWKGQ","short_pith_number":"pith:62UPGVFQ","schema_version":"1.0","canonical_sha256":"f6a8f354b0a0bc16b6715a9cf646ca343a4ae0c3f39b3ce34e4892694c28fe45","source":{"kind":"arxiv","id":"1703.03074","version":4},"attestation_state":"computed","paper":{"title":"Efficient computational strategies to learn the structure of probabilistic graphical models of cumulative phenomena","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Alex Graudenzi, Daniele Ramazzotti, Marco Antoniotti, Marco S. Nobile","submitted_at":"2017-03-08T23:50:19Z","abstract_excerpt":"Structural learning of Bayesian Networks (BNs) is a NP-hard problem, which is further complicated by many theoretical issues, such as the I-equivalence among different structures. In this work, we focus on a specific subclass of BNs, named Suppes-Bayes Causal Networks (SBCNs), which include specific structural constraints based on Suppes' probabilistic causation to efficiently model cumulative phenomena. Here we compare the performance, via extensive simulations, of various state-of-the-art search strategies, such as local search techniques and Genetic Algorithms, as well as of distinct regula"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1703.03074","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-08T23:50:19Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4ea7e961afc761c812f3bbeb6de214540edec0cab29d071c6ea2ea28e7f5b159","abstract_canon_sha256":"c3ed882fe72515ebc5c5e3247e6533959c7afa7a9e270e1b1ddcd07e479b184c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:36.502045Z","signature_b64":"8Ar2z9H7RFaMTpEs4a7UQqPlu6HeI/iEHMVu9eb3+qGlxhlR0n8gEUSIFbbN1/l5JvZ++1jd3uisYs7mSmzXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6a8f354b0a0bc16b6715a9cf646ca343a4ae0c3f39b3ce34e4892694c28fe45","last_reissued_at":"2026-05-18T00:02:36.501345Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:36.501345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient computational strategies to learn the structure of probabilistic graphical models of cumulative phenomena","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Alex Graudenzi, Daniele Ramazzotti, Marco Antoniotti, Marco S. Nobile","submitted_at":"2017-03-08T23:50:19Z","abstract_excerpt":"Structural learning of Bayesian Networks (BNs) is a NP-hard problem, which is further complicated by many theoretical issues, such as the I-equivalence among different structures. In this work, we focus on a specific subclass of BNs, named Suppes-Bayes Causal Networks (SBCNs), which include specific structural constraints based on Suppes' probabilistic causation to efficiently model cumulative phenomena. Here we compare the performance, via extensive simulations, of various state-of-the-art search strategies, such as local search techniques and Genetic Algorithms, as well as of distinct regula"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03074","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.03074","created_at":"2026-05-18T00:02:36.501474+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.03074v4","created_at":"2026-05-18T00:02:36.501474+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03074","created_at":"2026-05-18T00:02:36.501474+00:00"},{"alias_kind":"pith_short_12","alias_value":"62UPGVFQUC6B","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"62UPGVFQUC6BNNTR","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"62UPGVFQ","created_at":"2026-05-18T12:31:03.183658+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/62UPGVFQUC6BNNTRLKOPMRWKGQ","json":"https://pith.science/pith/62UPGVFQUC6BNNTRLKOPMRWKGQ.json","graph_json":"https://pith.science/api/pith-number/62UPGVFQUC6BNNTRLKOPMRWKGQ/graph.json","events_json":"https://pith.science/api/pith-number/62UPGVFQUC6BNNTRLKOPMRWKGQ/events.json","paper":"https://pith.science/paper/62UPGVFQ"},"agent_actions":{"view_html":"https://pith.science/pith/62UPGVFQUC6BNNTRLKOPMRWKGQ","download_json":"https://pith.science/pith/62UPGVFQUC6BNNTRLKOPMRWKGQ.json","view_paper":"https://pith.science/paper/62UPGVFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.03074&json=true","fetch_graph":"https://pith.science/api/pith-number/62UPGVFQUC6BNNTRLKOPMRWKGQ/graph.json","fetch_events":"https://pith.science/api/pith-number/62UPGVFQUC6BNNTRLKOPMRWKGQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/62UPGVFQUC6BNNTRLKOPMRWKGQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/62UPGVFQUC6BNNTRLKOPMRWKGQ/action/storage_attestation","attest_author":"https://pith.science/pith/62UPGVFQUC6BNNTRLKOPMRWKGQ/action/author_attestation","sign_citation":"https://pith.science/pith/62UPGVFQUC6BNNTRLKOPMRWKGQ/action/citation_signature","submit_replication":"https://pith.science/pith/62UPGVFQUC6BNNTRLKOPMRWKGQ/action/replication_record"}},"created_at":"2026-05-18T00:02:36.501474+00:00","updated_at":"2026-05-18T00:02:36.501474+00:00"}