{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KGTDFFCL6IJJTVYXDX2HZNTH6K","short_pith_number":"pith:KGTDFFCL","schema_version":"1.0","canonical_sha256":"51a632944bf21299d7171df47cb667f2b8571ca38fc21c500c40ec01d89dc74f","source":{"kind":"arxiv","id":"1810.10636","version":1},"attestation_state":"computed","paper":{"title":"Compositional Set Invariance in Network Systems with Assume-Guarantee Contracts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Aaron D. Ames, James Anderson, Karan Kalsi, Steven H. Low, Yuxiao Chen","submitted_at":"2018-10-24T21:45:35Z","abstract_excerpt":"This paper presents an assume-guarantee reasoning approach to the computation of robust invariant sets for network systems. Parameterized signal temporal logic (pSTL) is used to formally describe the behaviors of the subsystems, which we use as the template for the contract. We show that set invariance can be proved with a valid assume-guarantee contract by reasoning about individual subsystems. If a valid assume-guarantee contract with monotonic pSTL template is known, it can be further refined by value iteration. When such a contract is not known, an epigraph method is proposed to solve for "},"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.10636","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-24T21:45:35Z","cross_cats_sorted":[],"title_canon_sha256":"0304d3cc52544e3322c62e63c078aec3b8a2d769594ebf1e0f36562341b75fff","abstract_canon_sha256":"4bf8d25ff5c1c1cb789afa07f9108a2595b5d47d8a82f1e10e14caf681504095"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:20.017276Z","signature_b64":"rMbOZmK9H5ZPFzFYHW9x4GmgYYvAY7OouAcZdfGYQgsVvSQGRlofQKMDeDx43SLK40d6rHH1nnEm6JgNAObkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51a632944bf21299d7171df47cb667f2b8571ca38fc21c500c40ec01d89dc74f","last_reissued_at":"2026-05-18T00:02:20.016882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:20.016882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compositional Set Invariance in Network Systems with Assume-Guarantee Contracts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Aaron D. Ames, James Anderson, Karan Kalsi, Steven H. Low, Yuxiao Chen","submitted_at":"2018-10-24T21:45:35Z","abstract_excerpt":"This paper presents an assume-guarantee reasoning approach to the computation of robust invariant sets for network systems. Parameterized signal temporal logic (pSTL) is used to formally describe the behaviors of the subsystems, which we use as the template for the contract. We show that set invariance can be proved with a valid assume-guarantee contract by reasoning about individual subsystems. If a valid assume-guarantee contract with monotonic pSTL template is known, it can be further refined by value iteration. When such a contract is not known, an epigraph method is proposed to solve for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10636","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.10636","created_at":"2026-05-18T00:02:20.016940+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.10636v1","created_at":"2026-05-18T00:02:20.016940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10636","created_at":"2026-05-18T00:02:20.016940+00:00"},{"alias_kind":"pith_short_12","alias_value":"KGTDFFCL6IJJ","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KGTDFFCL6IJJTVYX","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KGTDFFCL","created_at":"2026-05-18T12:32:33.847187+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/KGTDFFCL6IJJTVYXDX2HZNTH6K","json":"https://pith.science/pith/KGTDFFCL6IJJTVYXDX2HZNTH6K.json","graph_json":"https://pith.science/api/pith-number/KGTDFFCL6IJJTVYXDX2HZNTH6K/graph.json","events_json":"https://pith.science/api/pith-number/KGTDFFCL6IJJTVYXDX2HZNTH6K/events.json","paper":"https://pith.science/paper/KGTDFFCL"},"agent_actions":{"view_html":"https://pith.science/pith/KGTDFFCL6IJJTVYXDX2HZNTH6K","download_json":"https://pith.science/pith/KGTDFFCL6IJJTVYXDX2HZNTH6K.json","view_paper":"https://pith.science/paper/KGTDFFCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.10636&json=true","fetch_graph":"https://pith.science/api/pith-number/KGTDFFCL6IJJTVYXDX2HZNTH6K/graph.json","fetch_events":"https://pith.science/api/pith-number/KGTDFFCL6IJJTVYXDX2HZNTH6K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KGTDFFCL6IJJTVYXDX2HZNTH6K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KGTDFFCL6IJJTVYXDX2HZNTH6K/action/storage_attestation","attest_author":"https://pith.science/pith/KGTDFFCL6IJJTVYXDX2HZNTH6K/action/author_attestation","sign_citation":"https://pith.science/pith/KGTDFFCL6IJJTVYXDX2HZNTH6K/action/citation_signature","submit_replication":"https://pith.science/pith/KGTDFFCL6IJJTVYXDX2HZNTH6K/action/replication_record"}},"created_at":"2026-05-18T00:02:20.016940+00:00","updated_at":"2026-05-18T00:02:20.016940+00:00"}