{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:C52WUOWXZKDOJDRIDAZVVPRVYD","short_pith_number":"pith:C52WUOWX","canonical_record":{"source":{"id":"1810.01972","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-03T21:00:13Z","cross_cats_sorted":[],"title_canon_sha256":"9c9d763d3f59089485652efa900aeb29a2e4a914b2f57a7d03fa0bd1ec201698","abstract_canon_sha256":"c961b063984220e9a5efc2c1858f77883fc09349ed397f328f607b14583eb494"},"schema_version":"1.0"},"canonical_sha256":"17756a3ad7ca86e48e2818335abe35c0d68314a6fc598ee38e65887de10e5cb5","source":{"kind":"arxiv","id":"1810.01972","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01972","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01972v2","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01972","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"pith_short_12","alias_value":"C52WUOWXZKDO","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C52WUOWXZKDOJDRI","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C52WUOWX","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:C52WUOWXZKDOJDRIDAZVVPRVYD","target":"record","payload":{"canonical_record":{"source":{"id":"1810.01972","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-03T21:00:13Z","cross_cats_sorted":[],"title_canon_sha256":"9c9d763d3f59089485652efa900aeb29a2e4a914b2f57a7d03fa0bd1ec201698","abstract_canon_sha256":"c961b063984220e9a5efc2c1858f77883fc09349ed397f328f607b14583eb494"},"schema_version":"1.0"},"canonical_sha256":"17756a3ad7ca86e48e2818335abe35c0d68314a6fc598ee38e65887de10e5cb5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:24.633574Z","signature_b64":"BHu+twkiCq3RYxHwTuWA5irffIKucQf8whwTjhgNmKPD9Q3yXvaG0Ymvr1akvHezGxT25ups1vMbdT+8eZiyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17756a3ad7ca86e48e2818335abe35c0d68314a6fc598ee38e65887de10e5cb5","last_reissued_at":"2026-05-18T00:02:24.632896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:24.632896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.01972","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-05-18T00:02:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+BnYjRdLhKUJWmL4d1cx3gJskX0XJa1Tf7KvXHeY+cDkBgSN+8WBeMqSEPUMtBKUcecBQgeSjHomjHQSMAYyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:47:54.770454Z"},"content_sha256":"6439f038344c06848e672f4e182a11a25f7bafaafadcda0fd694904607a50578","schema_version":"1.0","event_id":"sha256:6439f038344c06848e672f4e182a11a25f7bafaafadcda0fd694904607a50578"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:C52WUOWXZKDOJDRIDAZVVPRVYD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lucas Mol, Ortrud R. Oellermann, Roc\\'io M. Casablanca","submitted_at":"2018-10-03T21:00:13Z","abstract_excerpt":"Let $G$ be a (multi)graph of order $n$ and let $u,v$ be vertices of $G$. The maximum number of internally disjoint $u$-$v$ paths in $G$ is denoted by $\\kappa_G(u,v)$, and the maximum number of edge-disjoint $u$-$v$ paths in $G$ is denoted by $\\lambda_G (u,v)$. The average connectivity of $G$ is defined by $\\overline{\\kappa}(G)=\\sum_{\\{u,v\\}\\subseteq V(G)} \\kappa_G(u,v)/\\tbinom{n}{2},$ and the average edge-connectivity of $G$ is defined by $\\overline{\\lambda}(G)=\\sum_{\\{u,v\\}\\subseteq V(G)} \\lambda_G(u,v)/\\tbinom{n}{2}$. A graph $G$ is called ideally connected if $\\kappa_G(u,v)=\\min\\{\\mathrm{de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01972","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":""},"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-18T00:02:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xo0Cj0ku2YfPm0b7Yk5Dv6Z0GRCIcHi4TAaR1a4rf9ETz0kXVmPt3Y3fUh6oeObTGyt7Z0LkhCrKpqHQbVhrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:47:54.771120Z"},"content_sha256":"b873e43bd56502e9783689293a488dab9ddcacfdfcb3b5e6a6f7ef92ffdd11ab","schema_version":"1.0","event_id":"sha256:b873e43bd56502e9783689293a488dab9ddcacfdfcb3b5e6a6f7ef92ffdd11ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C52WUOWXZKDOJDRIDAZVVPRVYD/bundle.json","state_url":"https://pith.science/pith/C52WUOWXZKDOJDRIDAZVVPRVYD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C52WUOWXZKDOJDRIDAZVVPRVYD/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-02T15:47:54Z","links":{"resolver":"https://pith.science/pith/C52WUOWXZKDOJDRIDAZVVPRVYD","bundle":"https://pith.science/pith/C52WUOWXZKDOJDRIDAZVVPRVYD/bundle.json","state":"https://pith.science/pith/C52WUOWXZKDOJDRIDAZVVPRVYD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C52WUOWXZKDOJDRIDAZVVPRVYD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:C52WUOWXZKDOJDRIDAZVVPRVYD","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":"c961b063984220e9a5efc2c1858f77883fc09349ed397f328f607b14583eb494","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-03T21:00:13Z","title_canon_sha256":"9c9d763d3f59089485652efa900aeb29a2e4a914b2f57a7d03fa0bd1ec201698"},"schema_version":"1.0","source":{"id":"1810.01972","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01972","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01972v2","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01972","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"pith_short_12","alias_value":"C52WUOWXZKDO","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C52WUOWXZKDOJDRI","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C52WUOWX","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:b873e43bd56502e9783689293a488dab9ddcacfdfcb3b5e6a6f7ef92ffdd11ab","target":"graph","created_at":"2026-05-18T00:02:24Z","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":"Let $G$ be a (multi)graph of order $n$ and let $u,v$ be vertices of $G$. The maximum number of internally disjoint $u$-$v$ paths in $G$ is denoted by $\\kappa_G(u,v)$, and the maximum number of edge-disjoint $u$-$v$ paths in $G$ is denoted by $\\lambda_G (u,v)$. The average connectivity of $G$ is defined by $\\overline{\\kappa}(G)=\\sum_{\\{u,v\\}\\subseteq V(G)} \\kappa_G(u,v)/\\tbinom{n}{2},$ and the average edge-connectivity of $G$ is defined by $\\overline{\\lambda}(G)=\\sum_{\\{u,v\\}\\subseteq V(G)} \\lambda_G(u,v)/\\tbinom{n}{2}$. A graph $G$ is called ideally connected if $\\kappa_G(u,v)=\\min\\{\\mathrm{de","authors_text":"Lucas Mol, Ortrud R. Oellermann, Roc\\'io M. Casablanca","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-03T21:00:13Z","title":"Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01972","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:6439f038344c06848e672f4e182a11a25f7bafaafadcda0fd694904607a50578","target":"record","created_at":"2026-05-18T00:02:24Z","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":"c961b063984220e9a5efc2c1858f77883fc09349ed397f328f607b14583eb494","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-03T21:00:13Z","title_canon_sha256":"9c9d763d3f59089485652efa900aeb29a2e4a914b2f57a7d03fa0bd1ec201698"},"schema_version":"1.0","source":{"id":"1810.01972","kind":"arxiv","version":2}},"canonical_sha256":"17756a3ad7ca86e48e2818335abe35c0d68314a6fc598ee38e65887de10e5cb5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17756a3ad7ca86e48e2818335abe35c0d68314a6fc598ee38e65887de10e5cb5","first_computed_at":"2026-05-18T00:02:24.632896Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:24.632896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BHu+twkiCq3RYxHwTuWA5irffIKucQf8whwTjhgNmKPD9Q3yXvaG0Ymvr1akvHezGxT25ups1vMbdT+8eZiyCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:24.633574Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.01972","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6439f038344c06848e672f4e182a11a25f7bafaafadcda0fd694904607a50578","sha256:b873e43bd56502e9783689293a488dab9ddcacfdfcb3b5e6a6f7ef92ffdd11ab"],"state_sha256":"59bee7fe7f5778b4d3dc8345a9749997a0fbda8d33095c1672218b279c1a028e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"txzBXNRNM9O+IVHH9tWg8pMNvIqg3aQQP8lR3r0E6/2y4QnTIuSHTSK7sssfh6cEbiUUZJwRLKseXq5N42BxAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:47:54.774144Z","bundle_sha256":"b7422e9050c731d82a2ab1bfe767f836b0b76d0fb25f4dc1b57fcca7c287ea00"}}