{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ISY3CEG4CRVIEGIGETFI3TUGSC","short_pith_number":"pith:ISY3CEG4","schema_version":"1.0","canonical_sha256":"44b1b110dc146a82190624ca8dce8690b9141720ef5c71b6136e0b7b4d307de8","source":{"kind":"arxiv","id":"1406.7136","version":1},"attestation_state":"computed","paper":{"title":"Verifying Component and Connector Models against Crosscutting Structural Views","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Bernhard Rumpe, Jan Oliver Ringert, Shahar Maoz","submitted_at":"2014-06-27T10:05:46Z","abstract_excerpt":"The structure of component and connector (C&C) models, which are used in many application domains of software engineering, consists of components at different containment levels, their typed input and output ports, and the connectors between them. C&C views, presented in [24], can be used to specify structural properties of C&C models in an expressive and intuitive way. In this work we address the verification of a C&C model against a C&C view and present efficient (polynomial) algorithms to decide satisfaction. A unique feature of our work, not present in existing approaches to checking struc"},"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":"1406.7136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2014-06-27T10:05:46Z","cross_cats_sorted":[],"title_canon_sha256":"207006425aeccdd994ce38d28c9ff373b13bc2d69447d5def6aac5a61ac2c9b6","abstract_canon_sha256":"554e58286708549bccfa6fbf969d0456595bce9a7d63044bed8435e005d2672b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:54.012783Z","signature_b64":"1Kykve9MZHm0K9mNW2rbslP1eYHlKcJVdOSPz/uw5XOskl2wdAt3UFcxjTvH+xyCfKtRSxosI25q9T4znstaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44b1b110dc146a82190624ca8dce8690b9141720ef5c71b6136e0b7b4d307de8","last_reissued_at":"2026-05-18T02:48:54.012258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:54.012258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verifying Component and Connector Models against Crosscutting Structural Views","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Bernhard Rumpe, Jan Oliver Ringert, Shahar Maoz","submitted_at":"2014-06-27T10:05:46Z","abstract_excerpt":"The structure of component and connector (C&C) models, which are used in many application domains of software engineering, consists of components at different containment levels, their typed input and output ports, and the connectors between them. C&C views, presented in [24], can be used to specify structural properties of C&C models in an expressive and intuitive way. In this work we address the verification of a C&C model against a C&C view and present efficient (polynomial) algorithms to decide satisfaction. A unique feature of our work, not present in existing approaches to checking struc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7136","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":"1406.7136","created_at":"2026-05-18T02:48:54.012330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.7136v1","created_at":"2026-05-18T02:48:54.012330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7136","created_at":"2026-05-18T02:48:54.012330+00:00"},{"alias_kind":"pith_short_12","alias_value":"ISY3CEG4CRVI","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"ISY3CEG4CRVIEGIG","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"ISY3CEG4","created_at":"2026-05-18T12:28:33.132498+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/ISY3CEG4CRVIEGIGETFI3TUGSC","json":"https://pith.science/pith/ISY3CEG4CRVIEGIGETFI3TUGSC.json","graph_json":"https://pith.science/api/pith-number/ISY3CEG4CRVIEGIGETFI3TUGSC/graph.json","events_json":"https://pith.science/api/pith-number/ISY3CEG4CRVIEGIGETFI3TUGSC/events.json","paper":"https://pith.science/paper/ISY3CEG4"},"agent_actions":{"view_html":"https://pith.science/pith/ISY3CEG4CRVIEGIGETFI3TUGSC","download_json":"https://pith.science/pith/ISY3CEG4CRVIEGIGETFI3TUGSC.json","view_paper":"https://pith.science/paper/ISY3CEG4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.7136&json=true","fetch_graph":"https://pith.science/api/pith-number/ISY3CEG4CRVIEGIGETFI3TUGSC/graph.json","fetch_events":"https://pith.science/api/pith-number/ISY3CEG4CRVIEGIGETFI3TUGSC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ISY3CEG4CRVIEGIGETFI3TUGSC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ISY3CEG4CRVIEGIGETFI3TUGSC/action/storage_attestation","attest_author":"https://pith.science/pith/ISY3CEG4CRVIEGIGETFI3TUGSC/action/author_attestation","sign_citation":"https://pith.science/pith/ISY3CEG4CRVIEGIGETFI3TUGSC/action/citation_signature","submit_replication":"https://pith.science/pith/ISY3CEG4CRVIEGIGETFI3TUGSC/action/replication_record"}},"created_at":"2026-05-18T02:48:54.012330+00:00","updated_at":"2026-05-18T02:48:54.012330+00:00"}