{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XV2VY2SQKQEDZORXMAR5OBHUTT","short_pith_number":"pith:XV2VY2SQ","canonical_record":{"source":{"id":"1401.3187","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-14T13:58:42Z","cross_cats_sorted":[],"title_canon_sha256":"a36971b5015bb5ffc7979e0c43d439f0606da56d1fc1d4176935b20f1cb69066","abstract_canon_sha256":"83ed825fe84d57a70d98078f352618139b3c70eff470c63ebf9099ba506ab76d"},"schema_version":"1.0"},"canonical_sha256":"bd755c6a5054083cba376023d704f49cebabf4aabff36cf850f089185ac8507d","source":{"kind":"arxiv","id":"1401.3187","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3187","created_at":"2026-05-18T00:59:28Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3187v2","created_at":"2026-05-18T00:59:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3187","created_at":"2026-05-18T00:59:28Z"},{"alias_kind":"pith_short_12","alias_value":"XV2VY2SQKQED","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XV2VY2SQKQEDZORX","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XV2VY2SQ","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XV2VY2SQKQEDZORXMAR5OBHUTT","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3187","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-14T13:58:42Z","cross_cats_sorted":[],"title_canon_sha256":"a36971b5015bb5ffc7979e0c43d439f0606da56d1fc1d4176935b20f1cb69066","abstract_canon_sha256":"83ed825fe84d57a70d98078f352618139b3c70eff470c63ebf9099ba506ab76d"},"schema_version":"1.0"},"canonical_sha256":"bd755c6a5054083cba376023d704f49cebabf4aabff36cf850f089185ac8507d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:28.179925Z","signature_b64":"VmhxOuTZw+gIH5CXRegyMr0HUiq35mp8jTAyNz45DF90DrBp6/unE1dN4w/bkphx3vrQ4VXSwukYAfA24eHSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd755c6a5054083cba376023d704f49cebabf4aabff36cf850f089185ac8507d","last_reissued_at":"2026-05-18T00:59:28.179336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:28.179336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3187","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:59:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GSHqUvY5EYxyJg9wh/+05WVFUjLBM8BCnb2tkfKrsqF9zkNMm3kjiP9T9QLplOzXjLGxFa88wCBlPrGkTbkABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:31:09.039760Z"},"content_sha256":"ba8f4a7cfa752c3afaf847d07e1c00096d7e7b9dc303e54c824fc14139c71860","schema_version":"1.0","event_id":"sha256:ba8f4a7cfa752c3afaf847d07e1c00096d7e7b9dc303e54c824fc14139c71860"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XV2VY2SQKQEDZORXMAR5OBHUTT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On restricted edge-connectivity of half-transitive multigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jixiang Meng, Xing Chen, Yingzhi Tian","submitted_at":"2014-01-14T13:58:42Z","abstract_excerpt":"Let $G=(V,E)$ be a multigraph (it has multiple edges, but no loops). The edge connectivity, denoted by $\\lambda(G)$, is the cardinality of a minimum edge-cut of $G$. We call $G$ maximally edge-connected if $\\lambda(G)=\\delta(G)$, and $G$ super edge-connected if every minimum edge-cut is a set of edges incident with some vertex. The restricted edge-connectivity $\\lambda'(G)$ of $G$ is the minimum number of edges whose removal disconnects $G$ into non-trivial components. If $\\lambda'(G)$ achieves the upper bound of restricted edge-connectivity, then $G$ is said to be $\\lambda'$-optimal. A bipart"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3187","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:59:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c9SqsIOEGkHDQuh7xZEvblnK57gP/xRDSpoH5iE02KMgMVO/1tSa+7h2z1ZPiP4U2WK/C5MEbVe+hxwQyC+RAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:31:09.040110Z"},"content_sha256":"e347d279800d851497286d8939a83320facb1f9d1c2881d7620f33c682eede08","schema_version":"1.0","event_id":"sha256:e347d279800d851497286d8939a83320facb1f9d1c2881d7620f33c682eede08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XV2VY2SQKQEDZORXMAR5OBHUTT/bundle.json","state_url":"https://pith.science/pith/XV2VY2SQKQEDZORXMAR5OBHUTT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XV2VY2SQKQEDZORXMAR5OBHUTT/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-03T06:31:09Z","links":{"resolver":"https://pith.science/pith/XV2VY2SQKQEDZORXMAR5OBHUTT","bundle":"https://pith.science/pith/XV2VY2SQKQEDZORXMAR5OBHUTT/bundle.json","state":"https://pith.science/pith/XV2VY2SQKQEDZORXMAR5OBHUTT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XV2VY2SQKQEDZORXMAR5OBHUTT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XV2VY2SQKQEDZORXMAR5OBHUTT","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":"83ed825fe84d57a70d98078f352618139b3c70eff470c63ebf9099ba506ab76d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-14T13:58:42Z","title_canon_sha256":"a36971b5015bb5ffc7979e0c43d439f0606da56d1fc1d4176935b20f1cb69066"},"schema_version":"1.0","source":{"id":"1401.3187","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3187","created_at":"2026-05-18T00:59:28Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3187v2","created_at":"2026-05-18T00:59:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3187","created_at":"2026-05-18T00:59:28Z"},{"alias_kind":"pith_short_12","alias_value":"XV2VY2SQKQED","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XV2VY2SQKQEDZORX","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XV2VY2SQ","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:e347d279800d851497286d8939a83320facb1f9d1c2881d7620f33c682eede08","target":"graph","created_at":"2026-05-18T00:59:28Z","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=(V,E)$ be a multigraph (it has multiple edges, but no loops). The edge connectivity, denoted by $\\lambda(G)$, is the cardinality of a minimum edge-cut of $G$. We call $G$ maximally edge-connected if $\\lambda(G)=\\delta(G)$, and $G$ super edge-connected if every minimum edge-cut is a set of edges incident with some vertex. The restricted edge-connectivity $\\lambda'(G)$ of $G$ is the minimum number of edges whose removal disconnects $G$ into non-trivial components. If $\\lambda'(G)$ achieves the upper bound of restricted edge-connectivity, then $G$ is said to be $\\lambda'$-optimal. A bipart","authors_text":"Jixiang Meng, Xing Chen, Yingzhi Tian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-14T13:58:42Z","title":"On restricted edge-connectivity of half-transitive multigraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3187","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:ba8f4a7cfa752c3afaf847d07e1c00096d7e7b9dc303e54c824fc14139c71860","target":"record","created_at":"2026-05-18T00:59:28Z","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":"83ed825fe84d57a70d98078f352618139b3c70eff470c63ebf9099ba506ab76d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-14T13:58:42Z","title_canon_sha256":"a36971b5015bb5ffc7979e0c43d439f0606da56d1fc1d4176935b20f1cb69066"},"schema_version":"1.0","source":{"id":"1401.3187","kind":"arxiv","version":2}},"canonical_sha256":"bd755c6a5054083cba376023d704f49cebabf4aabff36cf850f089185ac8507d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd755c6a5054083cba376023d704f49cebabf4aabff36cf850f089185ac8507d","first_computed_at":"2026-05-18T00:59:28.179336Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:28.179336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VmhxOuTZw+gIH5CXRegyMr0HUiq35mp8jTAyNz45DF90DrBp6/unE1dN4w/bkphx3vrQ4VXSwukYAfA24eHSCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:28.179925Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3187","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba8f4a7cfa752c3afaf847d07e1c00096d7e7b9dc303e54c824fc14139c71860","sha256:e347d279800d851497286d8939a83320facb1f9d1c2881d7620f33c682eede08"],"state_sha256":"25f6b682fa7e2b2c276f1a135e9429f920e0ffb1bad55af248b0ca6db467c257"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DScn8Gdp7UOResGXF3PcaJPqloZvwabwsFY2pXnNTKtt2Q2jZuV91PpuCJtF2BL0cYV92uc5SIh3JpQjQxxkDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:31:09.042109Z","bundle_sha256":"0d7b07d1f1e6317e596bc2efe3d583e01e93abf35e0380ed627e3ae5b941e2fa"}}