{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PGQPHLNCHSRZJ6ZVZ6RRINWZL5","short_pith_number":"pith:PGQPHLNC","canonical_record":{"source":{"id":"1901.06824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-21T08:45:38Z","cross_cats_sorted":[],"title_canon_sha256":"7aabaf7ef42a600919d791431eb3a5d6e2eeb5a17daf351cc24732c4896c7edb","abstract_canon_sha256":"f87bc6460466b3f4640f33cd458ee7fc55371145dfb21e1b592d153ed5a16bb8"},"schema_version":"1.0"},"canonical_sha256":"79a0f3ada23ca394fb35cfa31436d95f4041e0501de42cb7fa0b73b4f54a4799","source":{"kind":"arxiv","id":"1901.06824","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06824","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06824v1","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06824","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"pith_short_12","alias_value":"PGQPHLNCHSRZ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PGQPHLNCHSRZJ6ZV","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PGQPHLNC","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PGQPHLNCHSRZJ6ZVZ6RRINWZL5","target":"record","payload":{"canonical_record":{"source":{"id":"1901.06824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-21T08:45:38Z","cross_cats_sorted":[],"title_canon_sha256":"7aabaf7ef42a600919d791431eb3a5d6e2eeb5a17daf351cc24732c4896c7edb","abstract_canon_sha256":"f87bc6460466b3f4640f33cd458ee7fc55371145dfb21e1b592d153ed5a16bb8"},"schema_version":"1.0"},"canonical_sha256":"79a0f3ada23ca394fb35cfa31436d95f4041e0501de42cb7fa0b73b4f54a4799","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:49.047601Z","signature_b64":"Dzn5w9YaQRP7CO2XFZD+n5phN4F4aIGBXW3CNKGA95Z2/Kudiz2gV/zWlN9eIBUwQyZZ78UNg+epyptqrfyNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79a0f3ada23ca394fb35cfa31436d95f4041e0501de42cb7fa0b73b4f54a4799","last_reissued_at":"2026-05-17T23:55:49.047011Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:49.047011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.06824","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-17T23:55:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ncbrrrcqygtkMxvrbTyT2qrZmjaxwhRMR04ec2i5hUIHYLePYnhhDpMv6cKb9Mz2ABs4QjMZF7i+Yu0urdq9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T10:04:54.853013Z"},"content_sha256":"83b15e4ae99011b7a9715988f079d62fc46c38c0f7af8473be94e137f15262a2","schema_version":"1.0","event_id":"sha256:83b15e4ae99011b7a9715988f079d62fc46c38c0f7af8473be94e137f15262a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PGQPHLNCHSRZJ6ZVZ6RRINWZL5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Radius of Nonsplit Graphs and Information Dissemination in Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Kyrill Winkler, Matthias F\\\"ugger, Thomas Nowak","submitted_at":"2019-01-21T08:45:38Z","abstract_excerpt":"A nonsplit graph is a directed graph where each pair of nodes has a common incoming neighbor. We show that the radius of such graphs is in $O(\\log \\log n)$, where $n$ is the number of nodes. We then generalize the result to products of nonsplit graphs.\n  The analysis of nonsplit graph products has direct implications in the context of distributed systems, where processes operate in rounds and communicate via message passing in each round: communication graphs in several distributed systems naturally relate to nonsplit graphs and the graph product concisely represents relaying messages in such "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06824","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-17T23:55:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OIqeovZgo0CFO50Eiujf7M3s0itxe9pAs2KHgxdNI+zz0srNt8dcXMUtgJZ15ECRXNApobfjhAIj5qegx9owCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T10:04:54.853377Z"},"content_sha256":"43884f793d871d8dce33afde671b6bff7bc99050d9715756604f3a02dee90f77","schema_version":"1.0","event_id":"sha256:43884f793d871d8dce33afde671b6bff7bc99050d9715756604f3a02dee90f77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PGQPHLNCHSRZJ6ZVZ6RRINWZL5/bundle.json","state_url":"https://pith.science/pith/PGQPHLNCHSRZJ6ZVZ6RRINWZL5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PGQPHLNCHSRZJ6ZVZ6RRINWZL5/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-07-04T10:04:54Z","links":{"resolver":"https://pith.science/pith/PGQPHLNCHSRZJ6ZVZ6RRINWZL5","bundle":"https://pith.science/pith/PGQPHLNCHSRZJ6ZVZ6RRINWZL5/bundle.json","state":"https://pith.science/pith/PGQPHLNCHSRZJ6ZVZ6RRINWZL5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PGQPHLNCHSRZJ6ZVZ6RRINWZL5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PGQPHLNCHSRZJ6ZVZ6RRINWZL5","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":"f87bc6460466b3f4640f33cd458ee7fc55371145dfb21e1b592d153ed5a16bb8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-21T08:45:38Z","title_canon_sha256":"7aabaf7ef42a600919d791431eb3a5d6e2eeb5a17daf351cc24732c4896c7edb"},"schema_version":"1.0","source":{"id":"1901.06824","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06824","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06824v1","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06824","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"pith_short_12","alias_value":"PGQPHLNCHSRZ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PGQPHLNCHSRZJ6ZV","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PGQPHLNC","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:43884f793d871d8dce33afde671b6bff7bc99050d9715756604f3a02dee90f77","target":"graph","created_at":"2026-05-17T23:55:49Z","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":"A nonsplit graph is a directed graph where each pair of nodes has a common incoming neighbor. We show that the radius of such graphs is in $O(\\log \\log n)$, where $n$ is the number of nodes. We then generalize the result to products of nonsplit graphs.\n  The analysis of nonsplit graph products has direct implications in the context of distributed systems, where processes operate in rounds and communicate via message passing in each round: communication graphs in several distributed systems naturally relate to nonsplit graphs and the graph product concisely represents relaying messages in such ","authors_text":"Kyrill Winkler, Matthias F\\\"ugger, Thomas Nowak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-21T08:45:38Z","title":"On the Radius of Nonsplit Graphs and Information Dissemination in Dynamic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06824","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:83b15e4ae99011b7a9715988f079d62fc46c38c0f7af8473be94e137f15262a2","target":"record","created_at":"2026-05-17T23:55:49Z","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":"f87bc6460466b3f4640f33cd458ee7fc55371145dfb21e1b592d153ed5a16bb8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-21T08:45:38Z","title_canon_sha256":"7aabaf7ef42a600919d791431eb3a5d6e2eeb5a17daf351cc24732c4896c7edb"},"schema_version":"1.0","source":{"id":"1901.06824","kind":"arxiv","version":1}},"canonical_sha256":"79a0f3ada23ca394fb35cfa31436d95f4041e0501de42cb7fa0b73b4f54a4799","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79a0f3ada23ca394fb35cfa31436d95f4041e0501de42cb7fa0b73b4f54a4799","first_computed_at":"2026-05-17T23:55:49.047011Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:49.047011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dzn5w9YaQRP7CO2XFZD+n5phN4F4aIGBXW3CNKGA95Z2/Kudiz2gV/zWlN9eIBUwQyZZ78UNg+epyptqrfyNCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:49.047601Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.06824","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83b15e4ae99011b7a9715988f079d62fc46c38c0f7af8473be94e137f15262a2","sha256:43884f793d871d8dce33afde671b6bff7bc99050d9715756604f3a02dee90f77"],"state_sha256":"f750cdd2eb1da984db6a1efc5b96852a5a9c608081b1b10e58222c81c5fc6b62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RHpXoKN/uz+pKdD1X3Il4hXd5gmYtt7oTkPaeBn6cEOPpt0j9Dqcvw31sBsuC6rOI9aK696E1DGnzINjEPWoBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T10:04:54.855279Z","bundle_sha256":"ad1e29ffa6b1a7913a96ad30e752fec2e0b50c0dd3902acb10d2640dbd7740f2"}}