{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WTZQV7Y7P7DGKK5SNQTLHKJUEA","short_pith_number":"pith:WTZQV7Y7","schema_version":"1.0","canonical_sha256":"b4f30aff1f7fc6652bb26c26b3a9342039ac1d85ae899e62dd37184f5772b75d","source":{"kind":"arxiv","id":"1410.5486","version":1},"attestation_state":"computed","paper":{"title":"Characterizations of minimal graphs with equal edge connectivity and spanning tree packing number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong-Jian Lai, Ping Li, Senmei Yao, Xiaofeng Gu","submitted_at":"2014-10-20T22:13:18Z","abstract_excerpt":"With graphs considered as natural models for many network design problems, edge connectivity $\\kappa'(G)$ and maximum number of edge-disjoint spanning trees $\\tau(G)$ of a graph $G$ have been used as measures for reliability and strength in communication networks modeled as graph $G$ (see \\cite{Cunn85, Matula87}, among others). Mader \\cite{Mader71} and Matula \\cite{Matula72} introduced the maximum subgraph edge connectivity $\\overline{\\kappa'}(G)=\\max \\{\\kappa'(H): H \\mbox{ is a subgraph of } G \\}$. Motivated by their applications in network design and by the established inequalities \\[ \\overl"},"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":"1410.5486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-20T22:13:18Z","cross_cats_sorted":[],"title_canon_sha256":"1d54e40c0e5a8a2adfcc91307fd114e745be4ff8d0a49c27ad5ad4667edab8b5","abstract_canon_sha256":"3ac83aeb87a06007bfd8411fdacbb7272a58f9f42a87b4c6404da7f8f91d0070"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:39.745012Z","signature_b64":"8Wdz4BSSbMb/6xTW1snhMZNNGRGSspJ+rh9KwcHiBjF/P6PmYRH3krk78Yp2ncfGMe+LANJVhoncvMNyf+DBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4f30aff1f7fc6652bb26c26b3a9342039ac1d85ae899e62dd37184f5772b75d","last_reissued_at":"2026-05-18T02:39:39.744498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:39.744498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterizations of minimal graphs with equal edge connectivity and spanning tree packing number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong-Jian Lai, Ping Li, Senmei Yao, Xiaofeng Gu","submitted_at":"2014-10-20T22:13:18Z","abstract_excerpt":"With graphs considered as natural models for many network design problems, edge connectivity $\\kappa'(G)$ and maximum number of edge-disjoint spanning trees $\\tau(G)$ of a graph $G$ have been used as measures for reliability and strength in communication networks modeled as graph $G$ (see \\cite{Cunn85, Matula87}, among others). Mader \\cite{Mader71} and Matula \\cite{Matula72} introduced the maximum subgraph edge connectivity $\\overline{\\kappa'}(G)=\\max \\{\\kappa'(H): H \\mbox{ is a subgraph of } G \\}$. Motivated by their applications in network design and by the established inequalities \\[ \\overl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5486","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":"1410.5486","created_at":"2026-05-18T02:39:39.744568+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.5486v1","created_at":"2026-05-18T02:39:39.744568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5486","created_at":"2026-05-18T02:39:39.744568+00:00"},{"alias_kind":"pith_short_12","alias_value":"WTZQV7Y7P7DG","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WTZQV7Y7P7DGKK5S","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WTZQV7Y7","created_at":"2026-05-18T12:28:54.890064+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/WTZQV7Y7P7DGKK5SNQTLHKJUEA","json":"https://pith.science/pith/WTZQV7Y7P7DGKK5SNQTLHKJUEA.json","graph_json":"https://pith.science/api/pith-number/WTZQV7Y7P7DGKK5SNQTLHKJUEA/graph.json","events_json":"https://pith.science/api/pith-number/WTZQV7Y7P7DGKK5SNQTLHKJUEA/events.json","paper":"https://pith.science/paper/WTZQV7Y7"},"agent_actions":{"view_html":"https://pith.science/pith/WTZQV7Y7P7DGKK5SNQTLHKJUEA","download_json":"https://pith.science/pith/WTZQV7Y7P7DGKK5SNQTLHKJUEA.json","view_paper":"https://pith.science/paper/WTZQV7Y7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.5486&json=true","fetch_graph":"https://pith.science/api/pith-number/WTZQV7Y7P7DGKK5SNQTLHKJUEA/graph.json","fetch_events":"https://pith.science/api/pith-number/WTZQV7Y7P7DGKK5SNQTLHKJUEA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WTZQV7Y7P7DGKK5SNQTLHKJUEA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WTZQV7Y7P7DGKK5SNQTLHKJUEA/action/storage_attestation","attest_author":"https://pith.science/pith/WTZQV7Y7P7DGKK5SNQTLHKJUEA/action/author_attestation","sign_citation":"https://pith.science/pith/WTZQV7Y7P7DGKK5SNQTLHKJUEA/action/citation_signature","submit_replication":"https://pith.science/pith/WTZQV7Y7P7DGKK5SNQTLHKJUEA/action/replication_record"}},"created_at":"2026-05-18T02:39:39.744568+00:00","updated_at":"2026-05-18T02:39:39.744568+00:00"}