{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OB6DXHTNID5ELKWPGIPWDKTBSO","short_pith_number":"pith:OB6DXHTN","schema_version":"1.0","canonical_sha256":"707c3b9e6d40fa45aacf321f61aa6193a5dff9b176b70647271dfc5d76807031","source":{"kind":"arxiv","id":"1805.05026","version":1},"attestation_state":"computed","paper":{"title":"A Systematic Approach to Constructing Families of Incremental Topology Control Algorithms Using Graph Transformation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.SE","authors_text":"Andy Sch\\\"urr, Gergely Varr\\'o, Matthias Hollick, Max M\\\"uhlh\\\"auser, Michael Stein, Roland Kluge","submitted_at":"2018-05-14T07:00:38Z","abstract_excerpt":"In the communication systems domain, constructing and maintaining network topologies via topology control (TC) algorithms is an important cross-cutting research area. Network topologies are usually modeled using attributed graphs whose nodes and edges represent the network nodes and their interconnecting links. A key requirement of TC algorithms is to fulfill certain consistency and optimization properties to ensure a high quality of service. Still, few attempts have been made to constructively integrate these properties into the development process of TC algorithms. Furthermore, even though m"},"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":"1805.05026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-05-14T07:00:38Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"33e71914134258b0cebd815ff11b5e7a1c68072cf1daf2ba03d5bc0d6e8ad035","abstract_canon_sha256":"b8fee126771cb4e448dcbbb303f5625a295e17de93930cc67a95e2667279e228"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:04.036046Z","signature_b64":"M1aDvNW0jwEC94g1OQP3Q7/gqyocd/jkkXxiy02W901oyXdGEYiDBZwGLxG0pXzgNmzypcV8TlgwurQnnZbnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"707c3b9e6d40fa45aacf321f61aa6193a5dff9b176b70647271dfc5d76807031","last_reissued_at":"2026-05-18T00:16:04.035578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:04.035578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Systematic Approach to Constructing Families of Incremental Topology Control Algorithms Using Graph Transformation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.SE","authors_text":"Andy Sch\\\"urr, Gergely Varr\\'o, Matthias Hollick, Max M\\\"uhlh\\\"auser, Michael Stein, Roland Kluge","submitted_at":"2018-05-14T07:00:38Z","abstract_excerpt":"In the communication systems domain, constructing and maintaining network topologies via topology control (TC) algorithms is an important cross-cutting research area. Network topologies are usually modeled using attributed graphs whose nodes and edges represent the network nodes and their interconnecting links. A key requirement of TC algorithms is to fulfill certain consistency and optimization properties to ensure a high quality of service. Still, few attempts have been made to constructively integrate these properties into the development process of TC algorithms. Furthermore, even though m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05026","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":"1805.05026","created_at":"2026-05-18T00:16:04.035653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.05026v1","created_at":"2026-05-18T00:16:04.035653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05026","created_at":"2026-05-18T00:16:04.035653+00:00"},{"alias_kind":"pith_short_12","alias_value":"OB6DXHTNID5E","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OB6DXHTNID5ELKWP","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OB6DXHTN","created_at":"2026-05-18T12:32:43.782077+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/OB6DXHTNID5ELKWPGIPWDKTBSO","json":"https://pith.science/pith/OB6DXHTNID5ELKWPGIPWDKTBSO.json","graph_json":"https://pith.science/api/pith-number/OB6DXHTNID5ELKWPGIPWDKTBSO/graph.json","events_json":"https://pith.science/api/pith-number/OB6DXHTNID5ELKWPGIPWDKTBSO/events.json","paper":"https://pith.science/paper/OB6DXHTN"},"agent_actions":{"view_html":"https://pith.science/pith/OB6DXHTNID5ELKWPGIPWDKTBSO","download_json":"https://pith.science/pith/OB6DXHTNID5ELKWPGIPWDKTBSO.json","view_paper":"https://pith.science/paper/OB6DXHTN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.05026&json=true","fetch_graph":"https://pith.science/api/pith-number/OB6DXHTNID5ELKWPGIPWDKTBSO/graph.json","fetch_events":"https://pith.science/api/pith-number/OB6DXHTNID5ELKWPGIPWDKTBSO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OB6DXHTNID5ELKWPGIPWDKTBSO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OB6DXHTNID5ELKWPGIPWDKTBSO/action/storage_attestation","attest_author":"https://pith.science/pith/OB6DXHTNID5ELKWPGIPWDKTBSO/action/author_attestation","sign_citation":"https://pith.science/pith/OB6DXHTNID5ELKWPGIPWDKTBSO/action/citation_signature","submit_replication":"https://pith.science/pith/OB6DXHTNID5ELKWPGIPWDKTBSO/action/replication_record"}},"created_at":"2026-05-18T00:16:04.035653+00:00","updated_at":"2026-05-18T00:16:04.035653+00:00"}