{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OGSBFPFOJBECQP4S7EKECNE2TD","short_pith_number":"pith:OGSBFPFO","schema_version":"1.0","canonical_sha256":"71a412bcae4848283f92f91441349a98cd2ff96a94ee400c227631104da93663","source":{"kind":"arxiv","id":"1205.5367","version":1},"attestation_state":"computed","paper":{"title":"Language-Constraint Reachability Learning in Probabilistic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Claudio Taranto, Floriana Esposito, Nicola Di Mauro","submitted_at":"2012-05-24T08:43:14Z","abstract_excerpt":"The probabilistic graphs framework models the uncertainty inherent in real-world domains by means of probabilistic edges whose value quantifies the likelihood of the edge existence or the strength of the link it represents. The goal of this paper is to provide a learning method to compute the most likely relationship between two nodes in a framework based on probabilistic graphs. In particular, given a probabilistic graph we adopted the language-constraint reachability method to compute the probability of possible interconnections that may exists between two nodes. Each of these connections ma"},"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":"1205.5367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-05-24T08:43:14Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"603e6811fec6685797a6a22ac8f375045d7419fdc843701fdf6a509f49c939e8","abstract_canon_sha256":"736355a5cfc64bb3e2160f0f53d6f19904547567613d707fc167a8a44a60530c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:01.158665Z","signature_b64":"4dOclHm7i4gK9c5fYwulia9vGSyn7FG0l6hpxcR6p3jEJ2GFq4c4My2W7cQ8U6qkj6qSzm7X5ySp5BnkJ8vnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71a412bcae4848283f92f91441349a98cd2ff96a94ee400c227631104da93663","last_reissued_at":"2026-05-18T03:55:01.157802Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:01.157802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Language-Constraint Reachability Learning in Probabilistic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Claudio Taranto, Floriana Esposito, Nicola Di Mauro","submitted_at":"2012-05-24T08:43:14Z","abstract_excerpt":"The probabilistic graphs framework models the uncertainty inherent in real-world domains by means of probabilistic edges whose value quantifies the likelihood of the edge existence or the strength of the link it represents. The goal of this paper is to provide a learning method to compute the most likely relationship between two nodes in a framework based on probabilistic graphs. In particular, given a probabilistic graph we adopted the language-constraint reachability method to compute the probability of possible interconnections that may exists between two nodes. Each of these connections ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.5367","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":""},"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":"1205.5367","created_at":"2026-05-18T03:55:01.157942+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.5367v1","created_at":"2026-05-18T03:55:01.157942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.5367","created_at":"2026-05-18T03:55:01.157942+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGSBFPFOJBEC","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGSBFPFOJBECQP4S","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGSBFPFO","created_at":"2026-05-18T12:27:16.716162+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/OGSBFPFOJBECQP4S7EKECNE2TD","json":"https://pith.science/pith/OGSBFPFOJBECQP4S7EKECNE2TD.json","graph_json":"https://pith.science/api/pith-number/OGSBFPFOJBECQP4S7EKECNE2TD/graph.json","events_json":"https://pith.science/api/pith-number/OGSBFPFOJBECQP4S7EKECNE2TD/events.json","paper":"https://pith.science/paper/OGSBFPFO"},"agent_actions":{"view_html":"https://pith.science/pith/OGSBFPFOJBECQP4S7EKECNE2TD","download_json":"https://pith.science/pith/OGSBFPFOJBECQP4S7EKECNE2TD.json","view_paper":"https://pith.science/paper/OGSBFPFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.5367&json=true","fetch_graph":"https://pith.science/api/pith-number/OGSBFPFOJBECQP4S7EKECNE2TD/graph.json","fetch_events":"https://pith.science/api/pith-number/OGSBFPFOJBECQP4S7EKECNE2TD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGSBFPFOJBECQP4S7EKECNE2TD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGSBFPFOJBECQP4S7EKECNE2TD/action/storage_attestation","attest_author":"https://pith.science/pith/OGSBFPFOJBECQP4S7EKECNE2TD/action/author_attestation","sign_citation":"https://pith.science/pith/OGSBFPFOJBECQP4S7EKECNE2TD/action/citation_signature","submit_replication":"https://pith.science/pith/OGSBFPFOJBECQP4S7EKECNE2TD/action/replication_record"}},"created_at":"2026-05-18T03:55:01.157942+00:00","updated_at":"2026-05-18T03:55:01.157942+00:00"}