{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IT3QVDXY4BMJBGJ7BV7QEQXOCQ","short_pith_number":"pith:IT3QVDXY","canonical_record":{"source":{"id":"1805.03386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-05-09T06:49:16Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"e93057d8913356b136ec078b48988ce132fbd9cafd65fbe51ca302ae63fd3671","abstract_canon_sha256":"e5d5be4850a479c497e09c3236fcb8da2bb136b2289693e183a3ad829759c3f5"},"schema_version":"1.0"},"canonical_sha256":"44f70a8ef8e05890993f0d7f0242ee140a60c2d0b3c19ea9f4dabee34757960d","source":{"kind":"arxiv","id":"1805.03386","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03386","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03386v1","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03386","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"pith_short_12","alias_value":"IT3QVDXY4BMJ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IT3QVDXY4BMJBGJ7","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IT3QVDXY","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IT3QVDXY4BMJBGJ7BV7QEQXOCQ","target":"record","payload":{"canonical_record":{"source":{"id":"1805.03386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-05-09T06:49:16Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"e93057d8913356b136ec078b48988ce132fbd9cafd65fbe51ca302ae63fd3671","abstract_canon_sha256":"e5d5be4850a479c497e09c3236fcb8da2bb136b2289693e183a3ad829759c3f5"},"schema_version":"1.0"},"canonical_sha256":"44f70a8ef8e05890993f0d7f0242ee140a60c2d0b3c19ea9f4dabee34757960d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:20.353696Z","signature_b64":"B8C0RMT/jBlxresz0QhrNjzGsDOy33BYypPGlv90gE72Ql4z5LAMdBNmf3F/Q1ATbfkI7TzfZytsgorXHhgeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44f70a8ef8e05890993f0d7f0242ee140a60c2d0b3c19ea9f4dabee34757960d","last_reissued_at":"2026-05-18T00:16:20.353166Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:20.353166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.03386","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:16:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0vezevDHyYSSwHqwELprz4RLGVt5YeOuPFk0aqcxd27Dx7bBooshnkEBkC5a/6JJr05W7dMvSQPwIQ5mB7ysDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:04:39.132771Z"},"content_sha256":"ea66aff669c0c1f35a1919435fb79f84e6cd4a49396140749da61cd53774d922","schema_version":"1.0","event_id":"sha256:ea66aff669c0c1f35a1919435fb79f84e6cd4a49396140749da61cd53774d922"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IT3QVDXY4BMJBGJ7BV7QEQXOCQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Systematic Approach to Constructing 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-09T06:49:16Z","abstract_excerpt":"Communication networks form the backbone of our society. Topology control algorithms optimize the topology of such communication networks. Due to the importance of communication networks, a topology control algorithm should guarantee certain required consistency properties (e.g., connectivity of the topology), while achieving desired optimization properties (e.g., a bounded number of neighbors). Real-world topologies are dynamic (e.g., because nodes join, leave, or move within the network), which requires topology control algorithms to operate in an incremental way, i.e., based on the recently"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03386","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:16:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r+EvuH4reuQ5mG1fcORRd/mYR7BEO98xqfof7R5EnT6rJT7HRfeZFh2SAADohOKpDEbt2H7IHQhMd6zBQhmBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:04:39.133431Z"},"content_sha256":"03ec910b3a42f9d80cf76c056c4a7a4109638478a7f1a83dce260a8f2a8ae21d","schema_version":"1.0","event_id":"sha256:03ec910b3a42f9d80cf76c056c4a7a4109638478a7f1a83dce260a8f2a8ae21d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IT3QVDXY4BMJBGJ7BV7QEQXOCQ/bundle.json","state_url":"https://pith.science/pith/IT3QVDXY4BMJBGJ7BV7QEQXOCQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IT3QVDXY4BMJBGJ7BV7QEQXOCQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T02:04:39Z","links":{"resolver":"https://pith.science/pith/IT3QVDXY4BMJBGJ7BV7QEQXOCQ","bundle":"https://pith.science/pith/IT3QVDXY4BMJBGJ7BV7QEQXOCQ/bundle.json","state":"https://pith.science/pith/IT3QVDXY4BMJBGJ7BV7QEQXOCQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IT3QVDXY4BMJBGJ7BV7QEQXOCQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IT3QVDXY4BMJBGJ7BV7QEQXOCQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e5d5be4850a479c497e09c3236fcb8da2bb136b2289693e183a3ad829759c3f5","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-05-09T06:49:16Z","title_canon_sha256":"e93057d8913356b136ec078b48988ce132fbd9cafd65fbe51ca302ae63fd3671"},"schema_version":"1.0","source":{"id":"1805.03386","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03386","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03386v1","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03386","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"pith_short_12","alias_value":"IT3QVDXY4BMJ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IT3QVDXY4BMJBGJ7","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IT3QVDXY","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:03ec910b3a42f9d80cf76c056c4a7a4109638478a7f1a83dce260a8f2a8ae21d","target":"graph","created_at":"2026-05-18T00:16:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Communication networks form the backbone of our society. Topology control algorithms optimize the topology of such communication networks. Due to the importance of communication networks, a topology control algorithm should guarantee certain required consistency properties (e.g., connectivity of the topology), while achieving desired optimization properties (e.g., a bounded number of neighbors). Real-world topologies are dynamic (e.g., because nodes join, leave, or move within the network), which requires topology control algorithms to operate in an incremental way, i.e., based on the recently","authors_text":"Andy Sch\\\"urr, Gergely Varr\\'o, Matthias Hollick, Max M\\\"uhlh\\\"auser, Michael Stein, Roland Kluge","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-05-09T06:49:16Z","title":"A Systematic Approach to Constructing Incremental Topology Control Algorithms Using Graph Transformation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03386","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ea66aff669c0c1f35a1919435fb79f84e6cd4a49396140749da61cd53774d922","target":"record","created_at":"2026-05-18T00:16:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e5d5be4850a479c497e09c3236fcb8da2bb136b2289693e183a3ad829759c3f5","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-05-09T06:49:16Z","title_canon_sha256":"e93057d8913356b136ec078b48988ce132fbd9cafd65fbe51ca302ae63fd3671"},"schema_version":"1.0","source":{"id":"1805.03386","kind":"arxiv","version":1}},"canonical_sha256":"44f70a8ef8e05890993f0d7f0242ee140a60c2d0b3c19ea9f4dabee34757960d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44f70a8ef8e05890993f0d7f0242ee140a60c2d0b3c19ea9f4dabee34757960d","first_computed_at":"2026-05-18T00:16:20.353166Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:20.353166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B8C0RMT/jBlxresz0QhrNjzGsDOy33BYypPGlv90gE72Ql4z5LAMdBNmf3F/Q1ATbfkI7TzfZytsgorXHhgeCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:20.353696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03386","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea66aff669c0c1f35a1919435fb79f84e6cd4a49396140749da61cd53774d922","sha256:03ec910b3a42f9d80cf76c056c4a7a4109638478a7f1a83dce260a8f2a8ae21d"],"state_sha256":"8ef1c8e3749b9b7ce35a098125cb2332cc2f9660872be79ffbdee836200d2bd5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rgSYJvhKFzteIvYqD22yC1VktSh8CytYq5k+fMkyZKQKNHGH9SB5jXgAEwVTUVVSk9sLK4Z3Rw2bKXnHRHtqDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:04:39.136901Z","bundle_sha256":"d8f9461d10e9b55f59fd10e8904bde7e75afecf13aaaa31e64552bb50d5e3547"}}