{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:NZQHNFIBHJLZQCB3NSNV76H44B","short_pith_number":"pith:NZQHNFIB","schema_version":"1.0","canonical_sha256":"6e607695013a5798083b6c9b5ff8fce05c71122762c38b061161ecf409d9b6ff","source":{"kind":"arxiv","id":"0907.3085","version":2},"attestation_state":"computed","paper":{"title":"A Metric Encoding for Bounded Model Checking (extended version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LO","authors_text":"Angelo Morzenti, Matteo Pradella, Pierluigi San Pietro","submitted_at":"2009-07-17T14:51:10Z","abstract_excerpt":"In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique which is particularly optimized for managing quantitative future and past metric temporal operators, typically found in properties of hard real time systems. The encoding is simple and intuitive in principle, but it is made more complex by the presence, typical of the Bounded Model Checking technique, of backward and forward loops used to represent an ultimately periodic infinite domain by a finite structure. We rep"},"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":"0907.3085","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-07-17T14:51:10Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"8af6754ccc53b24c5508e148e2e4dfac3cbdab1757377a12487a98889c13c79e","abstract_canon_sha256":"e0209593982923a45e484ea20b4111a5115c1e8e9dd7fa2b4532433fcf5f3487"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:56.119066Z","signature_b64":"ACxdKPnArRvlrZqM9NWkTcYmU8WkGHRur3zFyvyCqjLuv5c9Qee3uDhif4hhRRyvpKwCVyVgFM8hWsqCsKwTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e607695013a5798083b6c9b5ff8fce05c71122762c38b061161ecf409d9b6ff","last_reissued_at":"2026-05-18T02:12:56.118445Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:56.118445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Metric Encoding for Bounded Model Checking (extended version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LO","authors_text":"Angelo Morzenti, Matteo Pradella, Pierluigi San Pietro","submitted_at":"2009-07-17T14:51:10Z","abstract_excerpt":"In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique which is particularly optimized for managing quantitative future and past metric temporal operators, typically found in properties of hard real time systems. The encoding is simple and intuitive in principle, but it is made more complex by the presence, typical of the Bounded Model Checking technique, of backward and forward loops used to represent an ultimately periodic infinite domain by a finite structure. We rep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.3085","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":""},"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":"0907.3085","created_at":"2026-05-18T02:12:56.118534+00:00"},{"alias_kind":"arxiv_version","alias_value":"0907.3085v2","created_at":"2026-05-18T02:12:56.118534+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.3085","created_at":"2026-05-18T02:12:56.118534+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZQHNFIBHJLZ","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZQHNFIBHJLZQCB3","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZQHNFIB","created_at":"2026-05-18T12:26:01.383474+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/NZQHNFIBHJLZQCB3NSNV76H44B","json":"https://pith.science/pith/NZQHNFIBHJLZQCB3NSNV76H44B.json","graph_json":"https://pith.science/api/pith-number/NZQHNFIBHJLZQCB3NSNV76H44B/graph.json","events_json":"https://pith.science/api/pith-number/NZQHNFIBHJLZQCB3NSNV76H44B/events.json","paper":"https://pith.science/paper/NZQHNFIB"},"agent_actions":{"view_html":"https://pith.science/pith/NZQHNFIBHJLZQCB3NSNV76H44B","download_json":"https://pith.science/pith/NZQHNFIBHJLZQCB3NSNV76H44B.json","view_paper":"https://pith.science/paper/NZQHNFIB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0907.3085&json=true","fetch_graph":"https://pith.science/api/pith-number/NZQHNFIBHJLZQCB3NSNV76H44B/graph.json","fetch_events":"https://pith.science/api/pith-number/NZQHNFIBHJLZQCB3NSNV76H44B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZQHNFIBHJLZQCB3NSNV76H44B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZQHNFIBHJLZQCB3NSNV76H44B/action/storage_attestation","attest_author":"https://pith.science/pith/NZQHNFIBHJLZQCB3NSNV76H44B/action/author_attestation","sign_citation":"https://pith.science/pith/NZQHNFIBHJLZQCB3NSNV76H44B/action/citation_signature","submit_replication":"https://pith.science/pith/NZQHNFIBHJLZQCB3NSNV76H44B/action/replication_record"}},"created_at":"2026-05-18T02:12:56.118534+00:00","updated_at":"2026-05-18T02:12:56.118534+00:00"}