{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UMPWVWSGLPWLKTQKQCPITMXOII","short_pith_number":"pith:UMPWVWSG","schema_version":"1.0","canonical_sha256":"a31f6ada465becb54e0a809e89b2ee42365fefe1075885e7aee200216bcce2e1","source":{"kind":"arxiv","id":"1810.05495","version":1},"attestation_state":"computed","paper":{"title":"Towards a correct and efficient implementation of simulation and verification tools for probabilistic ntcc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mauricio Toro","submitted_at":"2018-10-05T03:08:47Z","abstract_excerpt":"We extended our simulation tool Ntccrt for probabilistic ntcc (pntcc) models. In addition, we developed a verification tool for pntcc models. Using this tool we can prove properties such as the system will go to a successful state with probability p under t discrete time- units. Currently, we are facing a few problems. We can only verify pntcc models using a finite domain constraint system and the encoding of cells ( mathematical entities that can update their value ) is experimental. In addition, in order to reduce the states generated during the verification process we need to implement a pr"},"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":"1810.05495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-10-05T03:08:47Z","cross_cats_sorted":[],"title_canon_sha256":"b222176cdcec377542702898f9ada9eca2a7a20c0fb85ade1b3c8b559f88c05b","abstract_canon_sha256":"87921d8620e6c1d13e16ef82d31c0f93b02165accd73fd5bff1acc63b50c0ddc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:30.337261Z","signature_b64":"PrBDJGTofl3RzNxPb4NVCAaf9mEuWj8qp/ubXHyxBrWvbTeUr0w7dRxVftF04YOH7lKXAReqyUQVsb1MQcVKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a31f6ada465becb54e0a809e89b2ee42365fefe1075885e7aee200216bcce2e1","last_reissued_at":"2026-05-18T00:03:30.336591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:30.336591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards a correct and efficient implementation of simulation and verification tools for probabilistic ntcc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mauricio Toro","submitted_at":"2018-10-05T03:08:47Z","abstract_excerpt":"We extended our simulation tool Ntccrt for probabilistic ntcc (pntcc) models. In addition, we developed a verification tool for pntcc models. Using this tool we can prove properties such as the system will go to a successful state with probability p under t discrete time- units. Currently, we are facing a few problems. We can only verify pntcc models using a finite domain constraint system and the encoding of cells ( mathematical entities that can update their value ) is experimental. In addition, in order to reduce the states generated during the verification process we need to implement a pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05495","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":"1810.05495","created_at":"2026-05-18T00:03:30.336718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.05495v1","created_at":"2026-05-18T00:03:30.336718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05495","created_at":"2026-05-18T00:03:30.336718+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMPWVWSGLPWL","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMPWVWSGLPWLKTQK","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMPWVWSG","created_at":"2026-05-18T12:32:56.356000+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/UMPWVWSGLPWLKTQKQCPITMXOII","json":"https://pith.science/pith/UMPWVWSGLPWLKTQKQCPITMXOII.json","graph_json":"https://pith.science/api/pith-number/UMPWVWSGLPWLKTQKQCPITMXOII/graph.json","events_json":"https://pith.science/api/pith-number/UMPWVWSGLPWLKTQKQCPITMXOII/events.json","paper":"https://pith.science/paper/UMPWVWSG"},"agent_actions":{"view_html":"https://pith.science/pith/UMPWVWSGLPWLKTQKQCPITMXOII","download_json":"https://pith.science/pith/UMPWVWSGLPWLKTQKQCPITMXOII.json","view_paper":"https://pith.science/paper/UMPWVWSG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.05495&json=true","fetch_graph":"https://pith.science/api/pith-number/UMPWVWSGLPWLKTQKQCPITMXOII/graph.json","fetch_events":"https://pith.science/api/pith-number/UMPWVWSGLPWLKTQKQCPITMXOII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMPWVWSGLPWLKTQKQCPITMXOII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMPWVWSGLPWLKTQKQCPITMXOII/action/storage_attestation","attest_author":"https://pith.science/pith/UMPWVWSGLPWLKTQKQCPITMXOII/action/author_attestation","sign_citation":"https://pith.science/pith/UMPWVWSGLPWLKTQKQCPITMXOII/action/citation_signature","submit_replication":"https://pith.science/pith/UMPWVWSGLPWLKTQKQCPITMXOII/action/replication_record"}},"created_at":"2026-05-18T00:03:30.336718+00:00","updated_at":"2026-05-18T00:03:30.336718+00:00"}