{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GMRK5VAWYQGYS3LAC4A62D6SUU","short_pith_number":"pith:GMRK5VAW","canonical_record":{"source":{"id":"1907.07219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-16T19:08:20Z","cross_cats_sorted":[],"title_canon_sha256":"83db51bd514357475c1e514372ae8ae994a41a2695c7d8b0ed10e70da4c33fc3","abstract_canon_sha256":"4a5cac067216a400e2aa92c0f549f422d30b480b26bc0f02143d3d17a9d51dc2"},"schema_version":"1.0"},"canonical_sha256":"3322aed416c40d896d601701ed0fd2a53705bd7290f6dc74146748151ba2a3e1","source":{"kind":"arxiv","id":"1907.07219","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07219","created_at":"2026-05-17T23:40:27Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07219v1","created_at":"2026-05-17T23:40:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07219","created_at":"2026-05-17T23:40:27Z"},{"alias_kind":"pith_short_12","alias_value":"GMRK5VAWYQGY","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GMRK5VAWYQGYS3LA","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GMRK5VAW","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GMRK5VAWYQGYS3LAC4A62D6SUU","target":"record","payload":{"canonical_record":{"source":{"id":"1907.07219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-16T19:08:20Z","cross_cats_sorted":[],"title_canon_sha256":"83db51bd514357475c1e514372ae8ae994a41a2695c7d8b0ed10e70da4c33fc3","abstract_canon_sha256":"4a5cac067216a400e2aa92c0f549f422d30b480b26bc0f02143d3d17a9d51dc2"},"schema_version":"1.0"},"canonical_sha256":"3322aed416c40d896d601701ed0fd2a53705bd7290f6dc74146748151ba2a3e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:27.422808Z","signature_b64":"GiKMd56rGiXWam/2/01Gd01sPa3yJpwGSmath60Zrtfh9adDVI2Yyg8oglzDTuRz/ytvZWfE6MdOTbFZM9TaDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3322aed416c40d896d601701ed0fd2a53705bd7290f6dc74146748151ba2a3e1","last_reissued_at":"2026-05-17T23:40:27.422232Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:27.422232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.07219","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:40:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AD9Fqq8Cf8C9yV2V3D6DxNYnG9vkRMw7AtJg+bKg1e+QY5GVGbJQhW78ukDkca/eTgmc/gexz3m2Uip3p07MAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T06:51:10.146357Z"},"content_sha256":"7bd343facc7bb3432cbb0b7599c5a853908ea448a4a67786a878791c78b53b9c","schema_version":"1.0","event_id":"sha256:7bd343facc7bb3432cbb0b7599c5a853908ea448a4a67786a878791c78b53b9c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GMRK5VAWYQGYS3LAC4A62D6SUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The maximum average connectivity among all orientations of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lucas Mol, Ortrud R. Oellermann, Peter Dankelmann, Rocio M. Casablanca, Wayne Goddard","submitted_at":"2019-07-16T19:08:20Z","abstract_excerpt":"For distinct vertices $u$ and $v$ in a graph $G$, the {\\em connectivity} between $u$ and $v$, denoted $\\kappa_G(u,v)$, is the maximum number of internally disjoint $u$--$v$ paths in $G$. The {\\em average connectivity} of $G$, denoted $\\overline{\\kappa}(G),$ is the average of $\\kappa_G(u,v)$ taken over all unordered pairs of distinct vertices $u,v$ of $G$. Analogously, for a directed graph $D$, the {\\em connectivity} from $u$ to $v$, denoted $\\kappa_D(u,v)$, is the maximum number of internally disjoint directed $u$--$v$ paths in $D$. The {\\em average connectivity} of $D$, denoted $\\overline{\\ka"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07219","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:40:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wUdWzBB3nziVQ71ixsaeLz/gtTXWYvdjbfPwgcscYj9etZwGBhZIpA1NuoUP0SbePYuLJMkmqxEQouu9ujFZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T06:51:10.146776Z"},"content_sha256":"e7fb0075a2b21a87a0bfe4ddaa928f235994c1f6489c6a8ca75ba1167d30b301","schema_version":"1.0","event_id":"sha256:e7fb0075a2b21a87a0bfe4ddaa928f235994c1f6489c6a8ca75ba1167d30b301"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GMRK5VAWYQGYS3LAC4A62D6SUU/bundle.json","state_url":"https://pith.science/pith/GMRK5VAWYQGYS3LAC4A62D6SUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GMRK5VAWYQGYS3LAC4A62D6SUU/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-22T06:51:10Z","links":{"resolver":"https://pith.science/pith/GMRK5VAWYQGYS3LAC4A62D6SUU","bundle":"https://pith.science/pith/GMRK5VAWYQGYS3LAC4A62D6SUU/bundle.json","state":"https://pith.science/pith/GMRK5VAWYQGYS3LAC4A62D6SUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GMRK5VAWYQGYS3LAC4A62D6SUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GMRK5VAWYQGYS3LAC4A62D6SUU","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":"4a5cac067216a400e2aa92c0f549f422d30b480b26bc0f02143d3d17a9d51dc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-16T19:08:20Z","title_canon_sha256":"83db51bd514357475c1e514372ae8ae994a41a2695c7d8b0ed10e70da4c33fc3"},"schema_version":"1.0","source":{"id":"1907.07219","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07219","created_at":"2026-05-17T23:40:27Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07219v1","created_at":"2026-05-17T23:40:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07219","created_at":"2026-05-17T23:40:27Z"},{"alias_kind":"pith_short_12","alias_value":"GMRK5VAWYQGY","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GMRK5VAWYQGYS3LA","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GMRK5VAW","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:e7fb0075a2b21a87a0bfe4ddaa928f235994c1f6489c6a8ca75ba1167d30b301","target":"graph","created_at":"2026-05-17T23:40:27Z","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":"For distinct vertices $u$ and $v$ in a graph $G$, the {\\em connectivity} between $u$ and $v$, denoted $\\kappa_G(u,v)$, is the maximum number of internally disjoint $u$--$v$ paths in $G$. The {\\em average connectivity} of $G$, denoted $\\overline{\\kappa}(G),$ is the average of $\\kappa_G(u,v)$ taken over all unordered pairs of distinct vertices $u,v$ of $G$. Analogously, for a directed graph $D$, the {\\em connectivity} from $u$ to $v$, denoted $\\kappa_D(u,v)$, is the maximum number of internally disjoint directed $u$--$v$ paths in $D$. The {\\em average connectivity} of $D$, denoted $\\overline{\\ka","authors_text":"Lucas Mol, Ortrud R. Oellermann, Peter Dankelmann, Rocio M. Casablanca, Wayne Goddard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-16T19:08:20Z","title":"The maximum average connectivity among all orientations of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07219","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:7bd343facc7bb3432cbb0b7599c5a853908ea448a4a67786a878791c78b53b9c","target":"record","created_at":"2026-05-17T23:40:27Z","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":"4a5cac067216a400e2aa92c0f549f422d30b480b26bc0f02143d3d17a9d51dc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-16T19:08:20Z","title_canon_sha256":"83db51bd514357475c1e514372ae8ae994a41a2695c7d8b0ed10e70da4c33fc3"},"schema_version":"1.0","source":{"id":"1907.07219","kind":"arxiv","version":1}},"canonical_sha256":"3322aed416c40d896d601701ed0fd2a53705bd7290f6dc74146748151ba2a3e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3322aed416c40d896d601701ed0fd2a53705bd7290f6dc74146748151ba2a3e1","first_computed_at":"2026-05-17T23:40:27.422232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:27.422232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GiKMd56rGiXWam/2/01Gd01sPa3yJpwGSmath60Zrtfh9adDVI2Yyg8oglzDTuRz/ytvZWfE6MdOTbFZM9TaDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:27.422808Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07219","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bd343facc7bb3432cbb0b7599c5a853908ea448a4a67786a878791c78b53b9c","sha256:e7fb0075a2b21a87a0bfe4ddaa928f235994c1f6489c6a8ca75ba1167d30b301"],"state_sha256":"38ef9a129309d81bcf78a720deef12f7652f39cef2d5dd205dd69427f6fe173f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+K8dbY8cCzWUk1DQ84Sjb1yUHipRPOfafcMqOtfkR45phpLSfhu+Qt82cejW+4ThN8GZOr1mOIfD1NzlqqrGCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T06:51:10.148685Z","bundle_sha256":"aef1819230b65b5f3ca129257dc4e0a5ef34af4ab89f9c0e3b0c039a4c101418"}}