{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BQSYHGGJELUFAT6TLDCKD6KF4T","short_pith_number":"pith:BQSYHGGJ","canonical_record":{"source":{"id":"1711.08890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-24T08:12:22Z","cross_cats_sorted":[],"title_canon_sha256":"66b3c8dce95c8c23faa3c204155b1947b2f390ba74a445b581ab0888dc87f920","abstract_canon_sha256":"54eac7a3bc7fa80949e18a45a048fa3eaf4a2e579cdd72ff643ad87825072fec"},"schema_version":"1.0"},"canonical_sha256":"0c258398c922e8504fd358c4a1f945e4c33eb3177f748ff25ef5235cd77472c4","source":{"kind":"arxiv","id":"1711.08890","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08890","created_at":"2026-05-18T00:29:41Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08890v1","created_at":"2026-05-18T00:29:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08890","created_at":"2026-05-18T00:29:41Z"},{"alias_kind":"pith_short_12","alias_value":"BQSYHGGJELUF","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BQSYHGGJELUFAT6T","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BQSYHGGJ","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BQSYHGGJELUFAT6TLDCKD6KF4T","target":"record","payload":{"canonical_record":{"source":{"id":"1711.08890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-24T08:12:22Z","cross_cats_sorted":[],"title_canon_sha256":"66b3c8dce95c8c23faa3c204155b1947b2f390ba74a445b581ab0888dc87f920","abstract_canon_sha256":"54eac7a3bc7fa80949e18a45a048fa3eaf4a2e579cdd72ff643ad87825072fec"},"schema_version":"1.0"},"canonical_sha256":"0c258398c922e8504fd358c4a1f945e4c33eb3177f748ff25ef5235cd77472c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:41.834440Z","signature_b64":"2MD/YCIZxTqH7bSl5IxwND/QVfAopUPUkdaO3/dQK9EhZI5lCIgNbs7/INdu0mKQFcFbTAHdD4I1HMJnACVBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c258398c922e8504fd358c4a1f945e4c33eb3177f748ff25ef5235cd77472c4","last_reissued_at":"2026-05-18T00:29:41.833809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:41.833809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.08890","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-18T00:29:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YOTUnXaD3ULJMJevG9Cero0FIaEpj5PPb6haJbYq5JneztIooCl1AHzr8HIBbq1pPwIRFNIb711uiCqvgx51DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:36:33.894054Z"},"content_sha256":"5d705edabd01862e34a55d933a6af0116a1173e2ce55d8001054a01168342af0","schema_version":"1.0","event_id":"sha256:5d705edabd01862e34a55d933a6af0116a1173e2ce55d8001054a01168342af0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BQSYHGGJELUFAT6TLDCKD6KF4T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Forbidden pairs for equality of edge-connectivity and minimum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Junfeng Du, Liming Xiong, Ziwen Huang","submitted_at":"2017-11-24T08:12:22Z","abstract_excerpt":"Let $\\mathcal{H}$ be a class of given graphs. A graph $G$ is said to be $\\mathcal{H}$-free if $G$ contains no induced copies of $H$ for any $H \\in \\mathcal{H}$. In this article, we characterize all pairs $\\{R,S\\}$ of graphs such that every connected $\\{R,S\\}$-free graph has the same edge-connectivity and minimum degree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08890","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-18T00:29:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zXh5r/9vEfAhYmWoSY+/oufrCTqy9UeRv2omQQV+58Cb5G+bwX80jMPUT6qw4H/BrgW3RZJXj+ad8q1P5GAZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:36:33.894551Z"},"content_sha256":"7f1d11f684eb486b41e5e14ab3286c3ad08def604a8b1cf8f900e5dbca20840e","schema_version":"1.0","event_id":"sha256:7f1d11f684eb486b41e5e14ab3286c3ad08def604a8b1cf8f900e5dbca20840e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQSYHGGJELUFAT6TLDCKD6KF4T/bundle.json","state_url":"https://pith.science/pith/BQSYHGGJELUFAT6TLDCKD6KF4T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQSYHGGJELUFAT6TLDCKD6KF4T/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-04T23:36:33Z","links":{"resolver":"https://pith.science/pith/BQSYHGGJELUFAT6TLDCKD6KF4T","bundle":"https://pith.science/pith/BQSYHGGJELUFAT6TLDCKD6KF4T/bundle.json","state":"https://pith.science/pith/BQSYHGGJELUFAT6TLDCKD6KF4T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQSYHGGJELUFAT6TLDCKD6KF4T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BQSYHGGJELUFAT6TLDCKD6KF4T","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":"54eac7a3bc7fa80949e18a45a048fa3eaf4a2e579cdd72ff643ad87825072fec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-24T08:12:22Z","title_canon_sha256":"66b3c8dce95c8c23faa3c204155b1947b2f390ba74a445b581ab0888dc87f920"},"schema_version":"1.0","source":{"id":"1711.08890","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08890","created_at":"2026-05-18T00:29:41Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08890v1","created_at":"2026-05-18T00:29:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08890","created_at":"2026-05-18T00:29:41Z"},{"alias_kind":"pith_short_12","alias_value":"BQSYHGGJELUF","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BQSYHGGJELUFAT6T","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BQSYHGGJ","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:7f1d11f684eb486b41e5e14ab3286c3ad08def604a8b1cf8f900e5dbca20840e","target":"graph","created_at":"2026-05-18T00:29:41Z","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 $\\mathcal{H}$ be a class of given graphs. A graph $G$ is said to be $\\mathcal{H}$-free if $G$ contains no induced copies of $H$ for any $H \\in \\mathcal{H}$. In this article, we characterize all pairs $\\{R,S\\}$ of graphs such that every connected $\\{R,S\\}$-free graph has the same edge-connectivity and minimum degree.","authors_text":"Junfeng Du, Liming Xiong, Ziwen Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-24T08:12:22Z","title":"Forbidden pairs for equality of edge-connectivity and minimum degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08890","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:5d705edabd01862e34a55d933a6af0116a1173e2ce55d8001054a01168342af0","target":"record","created_at":"2026-05-18T00:29:41Z","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":"54eac7a3bc7fa80949e18a45a048fa3eaf4a2e579cdd72ff643ad87825072fec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-24T08:12:22Z","title_canon_sha256":"66b3c8dce95c8c23faa3c204155b1947b2f390ba74a445b581ab0888dc87f920"},"schema_version":"1.0","source":{"id":"1711.08890","kind":"arxiv","version":1}},"canonical_sha256":"0c258398c922e8504fd358c4a1f945e4c33eb3177f748ff25ef5235cd77472c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c258398c922e8504fd358c4a1f945e4c33eb3177f748ff25ef5235cd77472c4","first_computed_at":"2026-05-18T00:29:41.833809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:41.833809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2MD/YCIZxTqH7bSl5IxwND/QVfAopUPUkdaO3/dQK9EhZI5lCIgNbs7/INdu0mKQFcFbTAHdD4I1HMJnACVBDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:41.834440Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.08890","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d705edabd01862e34a55d933a6af0116a1173e2ce55d8001054a01168342af0","sha256:7f1d11f684eb486b41e5e14ab3286c3ad08def604a8b1cf8f900e5dbca20840e"],"state_sha256":"a0b17dd749b0a0a4b39b22e28cae4596da7791358e153759f12486907f1e42cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OjHTHKXiCV0BtImb/9Itcw5tLU8zzNPyvozs/HzVDwN1JZqHHaKwa8E/WEe6SkKF9rsh1z5srO7bl/7dKeeYCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T23:36:33.897645Z","bundle_sha256":"0fa81cdabe6708d69d6a22aa11a207cb8e9f44d9132defff099554ba510fa332"}}