{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JYAE5FUJ4ZZVKTVEF63VPTJJUR","short_pith_number":"pith:JYAE5FUJ","canonical_record":{"source":{"id":"1908.03500","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-09T15:42:16Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"3949258dee4abf065ad31ff637a25c42b8dd9683cdccc254b16c72cb13492fbb","abstract_canon_sha256":"fd35201e05974f936d06affbae145b301337f7ad6dc4b06d402a4d221e37116c"},"schema_version":"1.0"},"canonical_sha256":"4e004e9689e673554ea42fb757cd29a44cbcd31e0ada3fd4ddce86b76fcaafe8","source":{"kind":"arxiv","id":"1908.03500","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03500","created_at":"2026-07-04T23:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03500v1","created_at":"2026-07-04T23:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03500","created_at":"2026-07-04T23:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"JYAE5FUJ4ZZV","created_at":"2026-07-04T23:52:40Z"},{"alias_kind":"pith_short_16","alias_value":"JYAE5FUJ4ZZVKTVE","created_at":"2026-07-04T23:52:40Z"},{"alias_kind":"pith_short_8","alias_value":"JYAE5FUJ","created_at":"2026-07-04T23:52:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JYAE5FUJ4ZZVKTVEF63VPTJJUR","target":"record","payload":{"canonical_record":{"source":{"id":"1908.03500","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-09T15:42:16Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"3949258dee4abf065ad31ff637a25c42b8dd9683cdccc254b16c72cb13492fbb","abstract_canon_sha256":"fd35201e05974f936d06affbae145b301337f7ad6dc4b06d402a4d221e37116c"},"schema_version":"1.0"},"canonical_sha256":"4e004e9689e673554ea42fb757cd29a44cbcd31e0ada3fd4ddce86b76fcaafe8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:40.452950Z","signature_b64":"AfvQp6aD803AVUwqkTpHwJXxuguwTtYLYreq+pT+Qgz1NzwjuUDoNUurag8r2ZILt3rD6pQM0vArLgLNBIRpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e004e9689e673554ea42fb757cd29a44cbcd31e0ada3fd4ddce86b76fcaafe8","last_reissued_at":"2026-07-04T23:52:40.452619Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:40.452619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.03500","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-07-04T23:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b6P3bN37/GWLmTbyw8RFsZTjMjgEspID/J+4soWhPqAewNfVSdL49A9h6Ix1ns2+r5GOjiBAgFiHNK3sP5OKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T04:13:21.938078Z"},"content_sha256":"7b93a9924b114f174bf183b22e1a4321134fb576bd13de55ca3bbd89e5e3702a","schema_version":"1.0","event_id":"sha256:7b93a9924b114f174bf183b22e1a4321134fb576bd13de55ca3bbd89e5e3702a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JYAE5FUJ4ZZVKTVEF63VPTJJUR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Julian Portmann, Mohsen Ghaffari","submitted_at":"2019-08-09T15:42:16Z","abstract_excerpt":"Network decompositions, as introduced by Awerbuch, Luby, Goldberg, and Plotkin [FOCS'89], are one of the key algorithmic tools in distributed graph algorithms. We present an improved deterministic distributed algorithm for constructing network decompositions of power graphs using small messages, which improves upon the algorithm of Ghaffari and Kuhn [DISC'18]. In addition, we provide a randomized distributed network decomposition algorithm, based on our deterministic algorithm, with failure probability exponentially small in the input size that works with small messages as well. Compared to th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03500","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.03500/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PtmCrFcn6rJbM3JqfHMCBNICNPfeXmHZx2ODbJEEUAuYjQFmow9SpuPSwop6rafLNmVeVQCH9UvDVU+krRH6Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T04:13:21.938660Z"},"content_sha256":"f07381f64e121c875dfb9aa05af633a65f4e4912d7875610ebb7742ab5139110","schema_version":"1.0","event_id":"sha256:f07381f64e121c875dfb9aa05af633a65f4e4912d7875610ebb7742ab5139110"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JYAE5FUJ4ZZVKTVEF63VPTJJUR/bundle.json","state_url":"https://pith.science/pith/JYAE5FUJ4ZZVKTVEF63VPTJJUR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JYAE5FUJ4ZZVKTVEF63VPTJJUR/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-08-16T04:13:21Z","links":{"resolver":"https://pith.science/pith/JYAE5FUJ4ZZVKTVEF63VPTJJUR","bundle":"https://pith.science/pith/JYAE5FUJ4ZZVKTVEF63VPTJJUR/bundle.json","state":"https://pith.science/pith/JYAE5FUJ4ZZVKTVEF63VPTJJUR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JYAE5FUJ4ZZVKTVEF63VPTJJUR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JYAE5FUJ4ZZVKTVEF63VPTJJUR","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":"fd35201e05974f936d06affbae145b301337f7ad6dc4b06d402a4d221e37116c","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-09T15:42:16Z","title_canon_sha256":"3949258dee4abf065ad31ff637a25c42b8dd9683cdccc254b16c72cb13492fbb"},"schema_version":"1.0","source":{"id":"1908.03500","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03500","created_at":"2026-07-04T23:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03500v1","created_at":"2026-07-04T23:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03500","created_at":"2026-07-04T23:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"JYAE5FUJ4ZZV","created_at":"2026-07-04T23:52:40Z"},{"alias_kind":"pith_short_16","alias_value":"JYAE5FUJ4ZZVKTVE","created_at":"2026-07-04T23:52:40Z"},{"alias_kind":"pith_short_8","alias_value":"JYAE5FUJ","created_at":"2026-07-04T23:52:40Z"}],"graph_snapshots":[{"event_id":"sha256:f07381f64e121c875dfb9aa05af633a65f4e4912d7875610ebb7742ab5139110","target":"graph","created_at":"2026-07-04T23:52:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.03500/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Network decompositions, as introduced by Awerbuch, Luby, Goldberg, and Plotkin [FOCS'89], are one of the key algorithmic tools in distributed graph algorithms. We present an improved deterministic distributed algorithm for constructing network decompositions of power graphs using small messages, which improves upon the algorithm of Ghaffari and Kuhn [DISC'18]. In addition, we provide a randomized distributed network decomposition algorithm, based on our deterministic algorithm, with failure probability exponentially small in the input size that works with small messages as well. Compared to th","authors_text":"Julian Portmann, Mohsen Ghaffari","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03500","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:7b93a9924b114f174bf183b22e1a4321134fb576bd13de55ca3bbd89e5e3702a","target":"record","created_at":"2026-07-04T23:52:40Z","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":"fd35201e05974f936d06affbae145b301337f7ad6dc4b06d402a4d221e37116c","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-09T15:42:16Z","title_canon_sha256":"3949258dee4abf065ad31ff637a25c42b8dd9683cdccc254b16c72cb13492fbb"},"schema_version":"1.0","source":{"id":"1908.03500","kind":"arxiv","version":1}},"canonical_sha256":"4e004e9689e673554ea42fb757cd29a44cbcd31e0ada3fd4ddce86b76fcaafe8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e004e9689e673554ea42fb757cd29a44cbcd31e0ada3fd4ddce86b76fcaafe8","first_computed_at":"2026-07-04T23:52:40.452619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:52:40.452619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AfvQp6aD803AVUwqkTpHwJXxuguwTtYLYreq+pT+Qgz1NzwjuUDoNUurag8r2ZILt3rD6pQM0vArLgLNBIRpAg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:52:40.452950Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.03500","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b93a9924b114f174bf183b22e1a4321134fb576bd13de55ca3bbd89e5e3702a","sha256:f07381f64e121c875dfb9aa05af633a65f4e4912d7875610ebb7742ab5139110"],"state_sha256":"2481df5b0fd96d9003caa9c61b31a0e5f27165c239b6208fe2a81a4e6534c32a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yw6RwzihXzUQwrMIjgi5Ek5ELRHnQilnYOGZatlBwOUCMxtEOPbVIInAI/qXcCuHhKlFhFYcgQ3a7iBF3rFVBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T04:13:21.945970Z","bundle_sha256":"45825e971ba56a722a0e6bd3caa9f07ee16d1d5d2724d201005a3cbffd4cc797"}}