{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PDSTZGT567FHHF4BWFUZOCT6GC","short_pith_number":"pith:PDSTZGT5","canonical_record":{"source":{"id":"1911.05606","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-11-12T14:52:17Z","cross_cats_sorted":[],"title_canon_sha256":"5077db7272023c4f407e1305b4a9eb82f5addaa1332c4271ed2e7ce31cab006d","abstract_canon_sha256":"2ee166381dd58c9c8cc1673ae3c8e8f0c0a65e040ccbe23a996492bb405fdaf7"},"schema_version":"1.0"},"canonical_sha256":"78e53c9a7df7ca739781b169970a7e30ab6fe26eeb1a332137e8777316601fa6","source":{"kind":"arxiv","id":"1911.05606","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.05606","created_at":"2026-07-05T01:26:06Z"},{"alias_kind":"arxiv_version","alias_value":"1911.05606v2","created_at":"2026-07-05T01:26:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.05606","created_at":"2026-07-05T01:26:06Z"},{"alias_kind":"pith_short_12","alias_value":"PDSTZGT567FH","created_at":"2026-07-05T01:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"PDSTZGT567FHHF4B","created_at":"2026-07-05T01:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"PDSTZGT5","created_at":"2026-07-05T01:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PDSTZGT567FHHF4BWFUZOCT6GC","target":"record","payload":{"canonical_record":{"source":{"id":"1911.05606","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-11-12T14:52:17Z","cross_cats_sorted":[],"title_canon_sha256":"5077db7272023c4f407e1305b4a9eb82f5addaa1332c4271ed2e7ce31cab006d","abstract_canon_sha256":"2ee166381dd58c9c8cc1673ae3c8e8f0c0a65e040ccbe23a996492bb405fdaf7"},"schema_version":"1.0"},"canonical_sha256":"78e53c9a7df7ca739781b169970a7e30ab6fe26eeb1a332137e8777316601fa6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:26:06.823137Z","signature_b64":"Eq5k9yHmB5HY7jiXAaH3oZZgvydq/CFluUPcWGHrXhy30TBa17Fx9P6S7VEwzL29lfCds4hB/2DxoTgj519CCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78e53c9a7df7ca739781b169970a7e30ab6fe26eeb1a332137e8777316601fa6","last_reissued_at":"2026-07-05T01:26:06.822636Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:26:06.822636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.05606","source_version":2,"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-05T01:26:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hc8lTc7qOaBehQHF949SWxP6itutFDlC/JsiVbNiBL5/xnH4z4cVWEV8vp+EBNFTt89rNatys++L2kNIotG1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:26:20.754655Z"},"content_sha256":"f60211d7e0189f7203beb9cfd369f8c56ed7ce2877b3186538d3ab68a1693f65","schema_version":"1.0","event_id":"sha256:f60211d7e0189f7203beb9cfd369f8c56ed7ce2877b3186538d3ab68a1693f65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PDSTZGT567FHHF4BWFUZOCT6GC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Asymptotic Connectivity of Random Graphs and Their Unions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Benjamin Robinson, Beth Bjorkman, Craig Thompson, Matthew Hale, Thomas Lamkin","submitted_at":"2019-11-12T14:52:17Z","abstract_excerpt":"Graph-theoretic methods have seen wide use throughout the literature on multi-agent control and optimization. When communications are intermittent and unpredictable, such networks have been modeled using random communication graphs. When graphs are time-varying, it is common to assume that their unions are connected over time, yet, to the best of our knowledge, there are not results that determine the number of finite-size random graphs needed to attain a connected union. Therefore, this paper bounds the probability that individual random graphs are connected and bounds the same probability fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.05606","kind":"arxiv","version":2},"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/1911.05606/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-05T01:26:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rddV8h27VP88xW4EBvsNGgD5iB7OKJYP+Tk8V2RweUktV8AZ3fKyLyQPlaokNzODNb/AqUfa0webXYuX7GMlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:26:20.755028Z"},"content_sha256":"989ed994fdc0241f44b307dea21304d0f47f082633a70c8ad4e4a6b16667dfd1","schema_version":"1.0","event_id":"sha256:989ed994fdc0241f44b307dea21304d0f47f082633a70c8ad4e4a6b16667dfd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PDSTZGT567FHHF4BWFUZOCT6GC/bundle.json","state_url":"https://pith.science/pith/PDSTZGT567FHHF4BWFUZOCT6GC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PDSTZGT567FHHF4BWFUZOCT6GC/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-06T20:26:20Z","links":{"resolver":"https://pith.science/pith/PDSTZGT567FHHF4BWFUZOCT6GC","bundle":"https://pith.science/pith/PDSTZGT567FHHF4BWFUZOCT6GC/bundle.json","state":"https://pith.science/pith/PDSTZGT567FHHF4BWFUZOCT6GC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PDSTZGT567FHHF4BWFUZOCT6GC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PDSTZGT567FHHF4BWFUZOCT6GC","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":"2ee166381dd58c9c8cc1673ae3c8e8f0c0a65e040ccbe23a996492bb405fdaf7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-11-12T14:52:17Z","title_canon_sha256":"5077db7272023c4f407e1305b4a9eb82f5addaa1332c4271ed2e7ce31cab006d"},"schema_version":"1.0","source":{"id":"1911.05606","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.05606","created_at":"2026-07-05T01:26:06Z"},{"alias_kind":"arxiv_version","alias_value":"1911.05606v2","created_at":"2026-07-05T01:26:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.05606","created_at":"2026-07-05T01:26:06Z"},{"alias_kind":"pith_short_12","alias_value":"PDSTZGT567FH","created_at":"2026-07-05T01:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"PDSTZGT567FHHF4B","created_at":"2026-07-05T01:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"PDSTZGT5","created_at":"2026-07-05T01:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:989ed994fdc0241f44b307dea21304d0f47f082633a70c8ad4e4a6b16667dfd1","target":"graph","created_at":"2026-07-05T01:26: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1911.05606/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph-theoretic methods have seen wide use throughout the literature on multi-agent control and optimization. When communications are intermittent and unpredictable, such networks have been modeled using random communication graphs. When graphs are time-varying, it is common to assume that their unions are connected over time, yet, to the best of our knowledge, there are not results that determine the number of finite-size random graphs needed to attain a connected union. Therefore, this paper bounds the probability that individual random graphs are connected and bounds the same probability fo","authors_text":"Benjamin Robinson, Beth Bjorkman, Craig Thompson, Matthew Hale, Thomas Lamkin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-11-12T14:52:17Z","title":"Non-Asymptotic Connectivity of Random Graphs and Their Unions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.05606","kind":"arxiv","version":2},"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:f60211d7e0189f7203beb9cfd369f8c56ed7ce2877b3186538d3ab68a1693f65","target":"record","created_at":"2026-07-05T01:26: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":"2ee166381dd58c9c8cc1673ae3c8e8f0c0a65e040ccbe23a996492bb405fdaf7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-11-12T14:52:17Z","title_canon_sha256":"5077db7272023c4f407e1305b4a9eb82f5addaa1332c4271ed2e7ce31cab006d"},"schema_version":"1.0","source":{"id":"1911.05606","kind":"arxiv","version":2}},"canonical_sha256":"78e53c9a7df7ca739781b169970a7e30ab6fe26eeb1a332137e8777316601fa6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78e53c9a7df7ca739781b169970a7e30ab6fe26eeb1a332137e8777316601fa6","first_computed_at":"2026-07-05T01:26:06.822636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:26:06.822636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Eq5k9yHmB5HY7jiXAaH3oZZgvydq/CFluUPcWGHrXhy30TBa17Fx9P6S7VEwzL29lfCds4hB/2DxoTgj519CCw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:26:06.823137Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.05606","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f60211d7e0189f7203beb9cfd369f8c56ed7ce2877b3186538d3ab68a1693f65","sha256:989ed994fdc0241f44b307dea21304d0f47f082633a70c8ad4e4a6b16667dfd1"],"state_sha256":"9bc31d2e233b03f3ba2dcf93462944c3ad6aae01411751b635556a5fa3a22e4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aDrFa51n6IaNt7DEv0pMO9sWLcN/qIrPPlxhsYguQBvxL/Vjq8k+KuZQGhtyORDUifdKcdpJzTBuZEpn3G29BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T20:26:20.756973Z","bundle_sha256":"62f0050b9973d025e9f77a878f205fa302511234b0906b283fa6869714488f66"}}