{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GMRK5VAWYQGYS3LAC4A62D6SUU","short_pith_number":"pith:GMRK5VAW","schema_version":"1.0","canonical_sha256":"3322aed416c40d896d601701ed0fd2a53705bd7290f6dc74146748151ba2a3e1","source":{"kind":"arxiv","id":"1907.07219","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.07219","created_at":"2026-05-17T23:40:27.422307+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.07219v1","created_at":"2026-05-17T23:40:27.422307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07219","created_at":"2026-05-17T23:40:27.422307+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMRK5VAWYQGY","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMRK5VAWYQGYS3LA","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMRK5VAW","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GMRK5VAWYQGYS3LAC4A62D6SUU","json":"https://pith.science/pith/GMRK5VAWYQGYS3LAC4A62D6SUU.json","graph_json":"https://pith.science/api/pith-number/GMRK5VAWYQGYS3LAC4A62D6SUU/graph.json","events_json":"https://pith.science/api/pith-number/GMRK5VAWYQGYS3LAC4A62D6SUU/events.json","paper":"https://pith.science/paper/GMRK5VAW"},"agent_actions":{"view_html":"https://pith.science/pith/GMRK5VAWYQGYS3LAC4A62D6SUU","download_json":"https://pith.science/pith/GMRK5VAWYQGYS3LAC4A62D6SUU.json","view_paper":"https://pith.science/paper/GMRK5VAW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.07219&json=true","fetch_graph":"https://pith.science/api/pith-number/GMRK5VAWYQGYS3LAC4A62D6SUU/graph.json","fetch_events":"https://pith.science/api/pith-number/GMRK5VAWYQGYS3LAC4A62D6SUU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMRK5VAWYQGYS3LAC4A62D6SUU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMRK5VAWYQGYS3LAC4A62D6SUU/action/storage_attestation","attest_author":"https://pith.science/pith/GMRK5VAWYQGYS3LAC4A62D6SUU/action/author_attestation","sign_citation":"https://pith.science/pith/GMRK5VAWYQGYS3LAC4A62D6SUU/action/citation_signature","submit_replication":"https://pith.science/pith/GMRK5VAWYQGYS3LAC4A62D6SUU/action/replication_record"}},"created_at":"2026-05-17T23:40:27.422307+00:00","updated_at":"2026-05-17T23:40:27.422307+00:00"}