{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RTTLAZQGED2YPKFJQVQXPEJ66P","short_pith_number":"pith:RTTLAZQG","schema_version":"1.0","canonical_sha256":"8ce6b0660620f587a8a9856177913ef3f9d550fa8fd0936404ab7ee8d760b86e","source":{"kind":"arxiv","id":"2606.00719","version":1},"attestation_state":"computed","paper":{"title":"Characterization of the structure of $k$-edge-maximal graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong-Jian Lai, Jian Lu, Zheng-Jiang Xia, Zhen-Mu Hong","submitted_at":"2026-05-30T13:05:05Z","abstract_excerpt":"Let $\\kappa^{\\prime}(G)$ be the edge-connectivity of the graph $G$. The \\textit{strength} of $G$, denoted by $\\overline{\\kappa}^{\\prime}(G)$, is the maximum edge-connectivity of its subgraphs. A simple graph $G$ is called $k$-\\textit{edge-maximal} if $\\overline{\\kappa}^{\\prime}(G) \\leq k$ but for any edge $e$ not in $G$, $\\overline{\\kappa}^{\\prime}(G+e) \\geq k+1$. In this paper, we propose the concepts of kernel and closure of a graph and discuss the properties of closure. Utilizing these properties, we present the necessary and sufficient condition for a graph to be $k$-edge-maximal, which re"},"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":"2606.00719","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-30T13:05:05Z","cross_cats_sorted":[],"title_canon_sha256":"2ed3761f90cc3437fc82e2aee4bedc8add5fe3cb1088eb04167a92b7ca7ed9b7","abstract_canon_sha256":"7fb993b74e09f1f74fa7f1ca74c529e1c0600b92aabcb13597f2b67e6177f096"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:04:03.697342Z","signature_b64":"fX4bgde3mBzC69MGSclrcW7M5yvGp4U82f1Y4EvbuSqqkq9ew7MZSYCYMFO78JOXFyaLBAYNLu0JXQWwc1+nCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ce6b0660620f587a8a9856177913ef3f9d550fa8fd0936404ab7ee8d760b86e","last_reissued_at":"2026-06-02T01:04:03.696936Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:04:03.696936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterization of the structure of $k$-edge-maximal graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong-Jian Lai, Jian Lu, Zheng-Jiang Xia, Zhen-Mu Hong","submitted_at":"2026-05-30T13:05:05Z","abstract_excerpt":"Let $\\kappa^{\\prime}(G)$ be the edge-connectivity of the graph $G$. The \\textit{strength} of $G$, denoted by $\\overline{\\kappa}^{\\prime}(G)$, is the maximum edge-connectivity of its subgraphs. A simple graph $G$ is called $k$-\\textit{edge-maximal} if $\\overline{\\kappa}^{\\prime}(G) \\leq k$ but for any edge $e$ not in $G$, $\\overline{\\kappa}^{\\prime}(G+e) \\geq k+1$. In this paper, we propose the concepts of kernel and closure of a graph and discuss the properties of closure. Utilizing these properties, we present the necessary and sufficient condition for a graph to be $k$-edge-maximal, which re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00719","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.00719/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.00719","created_at":"2026-06-02T01:04:03.696994+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.00719v1","created_at":"2026-06-02T01:04:03.696994+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00719","created_at":"2026-06-02T01:04:03.696994+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTTLAZQGED2Y","created_at":"2026-06-02T01:04:03.696994+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTTLAZQGED2YPKFJ","created_at":"2026-06-02T01:04:03.696994+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTTLAZQG","created_at":"2026-06-02T01:04:03.696994+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/RTTLAZQGED2YPKFJQVQXPEJ66P","json":"https://pith.science/pith/RTTLAZQGED2YPKFJQVQXPEJ66P.json","graph_json":"https://pith.science/api/pith-number/RTTLAZQGED2YPKFJQVQXPEJ66P/graph.json","events_json":"https://pith.science/api/pith-number/RTTLAZQGED2YPKFJQVQXPEJ66P/events.json","paper":"https://pith.science/paper/RTTLAZQG"},"agent_actions":{"view_html":"https://pith.science/pith/RTTLAZQGED2YPKFJQVQXPEJ66P","download_json":"https://pith.science/pith/RTTLAZQGED2YPKFJQVQXPEJ66P.json","view_paper":"https://pith.science/paper/RTTLAZQG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.00719&json=true","fetch_graph":"https://pith.science/api/pith-number/RTTLAZQGED2YPKFJQVQXPEJ66P/graph.json","fetch_events":"https://pith.science/api/pith-number/RTTLAZQGED2YPKFJQVQXPEJ66P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTTLAZQGED2YPKFJQVQXPEJ66P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTTLAZQGED2YPKFJQVQXPEJ66P/action/storage_attestation","attest_author":"https://pith.science/pith/RTTLAZQGED2YPKFJQVQXPEJ66P/action/author_attestation","sign_citation":"https://pith.science/pith/RTTLAZQGED2YPKFJQVQXPEJ66P/action/citation_signature","submit_replication":"https://pith.science/pith/RTTLAZQGED2YPKFJQVQXPEJ66P/action/replication_record"}},"created_at":"2026-06-02T01:04:03.696994+00:00","updated_at":"2026-06-02T01:04:03.696994+00:00"}