{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4AMC5P7AGRW66L6MW37WYFM2LV","short_pith_number":"pith:4AMC5P7A","canonical_record":{"source":{"id":"1502.00378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-02T06:52:57Z","cross_cats_sorted":[],"title_canon_sha256":"02b37d97c2a835ab951be25ec01b2bb91886334a45e5b755fa2cb53ca1332064","abstract_canon_sha256":"41d050663d3c3f9205ff0aaff30b58461b2d7fa551a5013d84850dd56a9c9c71"},"schema_version":"1.0"},"canonical_sha256":"e0182ebfe0346def2fccb6ff6c159a5d7e226ae0977319488f069505d215cf83","source":{"kind":"arxiv","id":"1502.00378","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00378","created_at":"2026-05-18T02:28:06Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00378v1","created_at":"2026-05-18T02:28:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00378","created_at":"2026-05-18T02:28:06Z"},{"alias_kind":"pith_short_12","alias_value":"4AMC5P7AGRW6","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4AMC5P7AGRW66L6M","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4AMC5P7A","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4AMC5P7AGRW66L6MW37WYFM2LV","target":"record","payload":{"canonical_record":{"source":{"id":"1502.00378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-02T06:52:57Z","cross_cats_sorted":[],"title_canon_sha256":"02b37d97c2a835ab951be25ec01b2bb91886334a45e5b755fa2cb53ca1332064","abstract_canon_sha256":"41d050663d3c3f9205ff0aaff30b58461b2d7fa551a5013d84850dd56a9c9c71"},"schema_version":"1.0"},"canonical_sha256":"e0182ebfe0346def2fccb6ff6c159a5d7e226ae0977319488f069505d215cf83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:06.104773Z","signature_b64":"RuyHqlA/F4NpWGazw8pWKI3X+XwtTRCd0L4xZHPACkoQDeNBniVwMOVaFf2+rj4yK+7WdqgXL38xAcQAH4VoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0182ebfe0346def2fccb6ff6c159a5d7e226ae0977319488f069505d215cf83","last_reissued_at":"2026-05-18T02:28:06.104209Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:06.104209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.00378","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-18T02:28:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VtbomKtTIP+Y1v9IgJQCsfJ/uiEc7PhKovpmCdB5HpOcfqRtIYwAkcRwgxaNVj6Asjj6i0LyBn7CuAwORiIYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:02:50.168565Z"},"content_sha256":"99bd99e853bd6f97f74b67e9d38847f71be1191d31cbb22543e393d32ad3ec60","schema_version":"1.0","event_id":"sha256:99bd99e853bd6f97f74b67e9d38847f71be1191d31cbb22543e393d32ad3ec60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4AMC5P7AGRW66L6MW37WYFM2LV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Franck Petit (REGAL, Mohamed-Hamza Kaaouachi (REGAL, Swan Dubois (REGAL, UPMC)","submitted_at":"2015-02-02T06:52:57Z","abstract_excerpt":"We address the problem of computing a Minimal Dominating Set in highly dynamic distributed systems. We assume weak connectivity, i.e., the network may be disconnected at each time instant and topological changes are unpredictable. We make only weak assumptions on the communication: every process is infinitely often able to communicate with other processes (not necessarily directly). Our contribution is threefold. First, we propose a new definition of minimal dominating set suitable for the context of time-varying graphs that seems more relevant than existing ones. Next, we provide a necessary "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00378","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-18T02:28:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gk0rcctIQkxDsrigfmEmuoiu04Yk5pNeuYk1IiEliC2bC0nTmx1yrcbV9VuRZ5biPU+DGBmUjQcwmUYNEysdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:02:50.169159Z"},"content_sha256":"ce22703c978a5284579f57e5779ab1258534200a0674c12bf192abbd8482bbad","schema_version":"1.0","event_id":"sha256:ce22703c978a5284579f57e5779ab1258534200a0674c12bf192abbd8482bbad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4AMC5P7AGRW66L6MW37WYFM2LV/bundle.json","state_url":"https://pith.science/pith/4AMC5P7AGRW66L6MW37WYFM2LV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4AMC5P7AGRW66L6MW37WYFM2LV/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-05-26T06:02:50Z","links":{"resolver":"https://pith.science/pith/4AMC5P7AGRW66L6MW37WYFM2LV","bundle":"https://pith.science/pith/4AMC5P7AGRW66L6MW37WYFM2LV/bundle.json","state":"https://pith.science/pith/4AMC5P7AGRW66L6MW37WYFM2LV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4AMC5P7AGRW66L6MW37WYFM2LV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4AMC5P7AGRW66L6MW37WYFM2LV","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":"41d050663d3c3f9205ff0aaff30b58461b2d7fa551a5013d84850dd56a9c9c71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-02T06:52:57Z","title_canon_sha256":"02b37d97c2a835ab951be25ec01b2bb91886334a45e5b755fa2cb53ca1332064"},"schema_version":"1.0","source":{"id":"1502.00378","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00378","created_at":"2026-05-18T02:28:06Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00378v1","created_at":"2026-05-18T02:28:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00378","created_at":"2026-05-18T02:28:06Z"},{"alias_kind":"pith_short_12","alias_value":"4AMC5P7AGRW6","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4AMC5P7AGRW66L6M","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4AMC5P7A","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:ce22703c978a5284579f57e5779ab1258534200a0674c12bf192abbd8482bbad","target":"graph","created_at":"2026-05-18T02:28:06Z","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":"We address the problem of computing a Minimal Dominating Set in highly dynamic distributed systems. We assume weak connectivity, i.e., the network may be disconnected at each time instant and topological changes are unpredictable. We make only weak assumptions on the communication: every process is infinitely often able to communicate with other processes (not necessarily directly). Our contribution is threefold. First, we propose a new definition of minimal dominating set suitable for the context of time-varying graphs that seems more relevant than existing ones. Next, we provide a necessary ","authors_text":"Franck Petit (REGAL, Mohamed-Hamza Kaaouachi (REGAL, Swan Dubois (REGAL, UPMC)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-02T06:52:57Z","title":"Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00378","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:99bd99e853bd6f97f74b67e9d38847f71be1191d31cbb22543e393d32ad3ec60","target":"record","created_at":"2026-05-18T02:28:06Z","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":"41d050663d3c3f9205ff0aaff30b58461b2d7fa551a5013d84850dd56a9c9c71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-02T06:52:57Z","title_canon_sha256":"02b37d97c2a835ab951be25ec01b2bb91886334a45e5b755fa2cb53ca1332064"},"schema_version":"1.0","source":{"id":"1502.00378","kind":"arxiv","version":1}},"canonical_sha256":"e0182ebfe0346def2fccb6ff6c159a5d7e226ae0977319488f069505d215cf83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0182ebfe0346def2fccb6ff6c159a5d7e226ae0977319488f069505d215cf83","first_computed_at":"2026-05-18T02:28:06.104209Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:06.104209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RuyHqlA/F4NpWGazw8pWKI3X+XwtTRCd0L4xZHPACkoQDeNBniVwMOVaFf2+rj4yK+7WdqgXL38xAcQAH4VoCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:06.104773Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.00378","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99bd99e853bd6f97f74b67e9d38847f71be1191d31cbb22543e393d32ad3ec60","sha256:ce22703c978a5284579f57e5779ab1258534200a0674c12bf192abbd8482bbad"],"state_sha256":"78bf29708c694b132c75dd7222163fabe6f698a5fbbdfe066faa2662ace55b3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bREsz163cb1yZCx+Q4rNUL5boIm+8Sr40u1/e1HpP87qGpBhXgPoHeJ5Wd9OIY7OlPzd5ZMieLqDW6pOsDejAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:02:50.172271Z","bundle_sha256":"6a3c4a5515a2656e4dbd386977550ee5d04c2f9d9473261be6269537c3dfe610"}}