{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:M7SNTJW4JSGMZGVTOLAONDPZRV","short_pith_number":"pith:M7SNTJW4","schema_version":"1.0","canonical_sha256":"67e4d9a6dc4c8ccc9ab372c0e68df98d5cc35b2dbe4fec3926a1a6814b5bde59","source":{"kind":"arxiv","id":"2307.13977","version":1},"attestation_state":"computed","paper":{"title":"Formal Verification of Robotic Contact Tasks via Reachability Analysis","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Chencheng Tang, Matthias Althoff","submitted_at":"2023-07-26T06:29:57Z","abstract_excerpt":"Verifying the correct behavior of robots in contact tasks is challenging due to model uncertainties associated with contacts. Standard methods for testing often fall short since all (uncountable many) solutions cannot be obtained. Instead, we propose to formally and efficiently verify robot behaviors in contact tasks using reachability analysis, which enables checking all the reachable states against user-provided specifications. To this end, we extend the state of the art in reachability analysis for hybrid (mixed discrete and continuous) dynamics subject to discrete-time input trajectories. "},"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":"2307.13977","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2023-07-26T06:29:57Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"077fda9ba8094acf4beb3384f85eb4ab5708213675c56e24b2d158926b71eb1c","abstract_canon_sha256":"bb370be0b3dad3c1f399b22c9a5cfe40ea365c16f4e4df677ccfefcd2d1ac47b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:16:44.461162Z","signature_b64":"qhBiGjoySJwEsV7qOwcwJ/M19XQsOQg5u54rJJDyky20EBOQynmptF/LrZyVKAkih2ReBNQxKEdpBXhwwBWEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67e4d9a6dc4c8ccc9ab372c0e68df98d5cc35b2dbe4fec3926a1a6814b5bde59","last_reissued_at":"2026-07-05T07:16:44.460724Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:16:44.460724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formal Verification of Robotic Contact Tasks via Reachability Analysis","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Chencheng Tang, Matthias Althoff","submitted_at":"2023-07-26T06:29:57Z","abstract_excerpt":"Verifying the correct behavior of robots in contact tasks is challenging due to model uncertainties associated with contacts. Standard methods for testing often fall short since all (uncountable many) solutions cannot be obtained. Instead, we propose to formally and efficiently verify robot behaviors in contact tasks using reachability analysis, which enables checking all the reachable states against user-provided specifications. To this end, we extend the state of the art in reachability analysis for hybrid (mixed discrete and continuous) dynamics subject to discrete-time input trajectories. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.13977","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/2307.13977/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2307.13977","created_at":"2026-07-05T07:16:44.460780+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.13977v1","created_at":"2026-07-05T07:16:44.460780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.13977","created_at":"2026-07-05T07:16:44.460780+00:00"},{"alias_kind":"pith_short_12","alias_value":"M7SNTJW4JSGM","created_at":"2026-07-05T07:16:44.460780+00:00"},{"alias_kind":"pith_short_16","alias_value":"M7SNTJW4JSGMZGVT","created_at":"2026-07-05T07:16:44.460780+00:00"},{"alias_kind":"pith_short_8","alias_value":"M7SNTJW4","created_at":"2026-07-05T07:16:44.460780+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/M7SNTJW4JSGMZGVTOLAONDPZRV","json":"https://pith.science/pith/M7SNTJW4JSGMZGVTOLAONDPZRV.json","graph_json":"https://pith.science/api/pith-number/M7SNTJW4JSGMZGVTOLAONDPZRV/graph.json","events_json":"https://pith.science/api/pith-number/M7SNTJW4JSGMZGVTOLAONDPZRV/events.json","paper":"https://pith.science/paper/M7SNTJW4"},"agent_actions":{"view_html":"https://pith.science/pith/M7SNTJW4JSGMZGVTOLAONDPZRV","download_json":"https://pith.science/pith/M7SNTJW4JSGMZGVTOLAONDPZRV.json","view_paper":"https://pith.science/paper/M7SNTJW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.13977&json=true","fetch_graph":"https://pith.science/api/pith-number/M7SNTJW4JSGMZGVTOLAONDPZRV/graph.json","fetch_events":"https://pith.science/api/pith-number/M7SNTJW4JSGMZGVTOLAONDPZRV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M7SNTJW4JSGMZGVTOLAONDPZRV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M7SNTJW4JSGMZGVTOLAONDPZRV/action/storage_attestation","attest_author":"https://pith.science/pith/M7SNTJW4JSGMZGVTOLAONDPZRV/action/author_attestation","sign_citation":"https://pith.science/pith/M7SNTJW4JSGMZGVTOLAONDPZRV/action/citation_signature","submit_replication":"https://pith.science/pith/M7SNTJW4JSGMZGVTOLAONDPZRV/action/replication_record"}},"created_at":"2026-07-05T07:16:44.460780+00:00","updated_at":"2026-07-05T07:16:44.460780+00:00"}