{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6TZUY4LM3KNMVVBWJVDQ6KLPD6","short_pith_number":"pith:6TZUY4LM","schema_version":"1.0","canonical_sha256":"f4f34c716cda9acad4364d470f296f1f8d4a9314948df491dc030c941a430567","source":{"kind":"arxiv","id":"1603.08851","version":1},"attestation_state":"computed","paper":{"title":"Rigorous constraint satisfaction for sampled linear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Moritz Schulze Darup","submitted_at":"2016-03-29T17:10:56Z","abstract_excerpt":"We address a specific but recurring problem related to sampled linear systems. In particular, we provide a numerical method for the rigorous verification of constraint satisfaction for linear continuous-time systems between sampling instances. The proposed algorithm combines elements of classical branch and bound schemes from global optimization with a recently published procedure to bound the exponential of interval matrices."},"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":"1603.08851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-29T17:10:56Z","cross_cats_sorted":[],"title_canon_sha256":"24a9182d21beb42c6fccf89e31281ef636a24a72e44b398455bb974298d4e55f","abstract_canon_sha256":"c6dd2908791ef4b8f4268c183acfb8ff1188f3ae2c6e8c53bb85000f9ee7f7a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:05.173781Z","signature_b64":"nIFwFw7WgvWeM3Q5GaIRpyVXC2lvzPwFkhMwZdRWnO7otgDoKSTtlwknjlAFrVt1cUs+I+5R9Qez5vQ9LjD+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4f34c716cda9acad4364d470f296f1f8d4a9314948df491dc030c941a430567","last_reissued_at":"2026-05-18T01:18:05.173184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:05.173184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rigorous constraint satisfaction for sampled linear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Moritz Schulze Darup","submitted_at":"2016-03-29T17:10:56Z","abstract_excerpt":"We address a specific but recurring problem related to sampled linear systems. In particular, we provide a numerical method for the rigorous verification of constraint satisfaction for linear continuous-time systems between sampling instances. The proposed algorithm combines elements of classical branch and bound schemes from global optimization with a recently published procedure to bound the exponential of interval matrices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08851","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":"1603.08851","created_at":"2026-05-18T01:18:05.173292+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.08851v1","created_at":"2026-05-18T01:18:05.173292+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08851","created_at":"2026-05-18T01:18:05.173292+00:00"},{"alias_kind":"pith_short_12","alias_value":"6TZUY4LM3KNM","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"6TZUY4LM3KNMVVBW","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"6TZUY4LM","created_at":"2026-05-18T12:30:04.600751+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/6TZUY4LM3KNMVVBWJVDQ6KLPD6","json":"https://pith.science/pith/6TZUY4LM3KNMVVBWJVDQ6KLPD6.json","graph_json":"https://pith.science/api/pith-number/6TZUY4LM3KNMVVBWJVDQ6KLPD6/graph.json","events_json":"https://pith.science/api/pith-number/6TZUY4LM3KNMVVBWJVDQ6KLPD6/events.json","paper":"https://pith.science/paper/6TZUY4LM"},"agent_actions":{"view_html":"https://pith.science/pith/6TZUY4LM3KNMVVBWJVDQ6KLPD6","download_json":"https://pith.science/pith/6TZUY4LM3KNMVVBWJVDQ6KLPD6.json","view_paper":"https://pith.science/paper/6TZUY4LM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.08851&json=true","fetch_graph":"https://pith.science/api/pith-number/6TZUY4LM3KNMVVBWJVDQ6KLPD6/graph.json","fetch_events":"https://pith.science/api/pith-number/6TZUY4LM3KNMVVBWJVDQ6KLPD6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6TZUY4LM3KNMVVBWJVDQ6KLPD6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6TZUY4LM3KNMVVBWJVDQ6KLPD6/action/storage_attestation","attest_author":"https://pith.science/pith/6TZUY4LM3KNMVVBWJVDQ6KLPD6/action/author_attestation","sign_citation":"https://pith.science/pith/6TZUY4LM3KNMVVBWJVDQ6KLPD6/action/citation_signature","submit_replication":"https://pith.science/pith/6TZUY4LM3KNMVVBWJVDQ6KLPD6/action/replication_record"}},"created_at":"2026-05-18T01:18:05.173292+00:00","updated_at":"2026-05-18T01:18:05.173292+00:00"}