{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AQ7FPHKWMXPW7KZ3B2SK2HZUJQ","short_pith_number":"pith:AQ7FPHKW","canonical_record":{"source":{"id":"1808.06101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-18T16:37:49Z","cross_cats_sorted":[],"title_canon_sha256":"56090ed64e6c67608de657f55fafb7757b5011b9a810179dd1f9b8ea4ebdc4ee","abstract_canon_sha256":"0c8c21a9ba3814cfcda908388dca851a93bbb330a5794e807403901a5db69534"},"schema_version":"1.0"},"canonical_sha256":"043e579d5665df6fab3b0ea4ad1f344c16a4c7a8112807e695ed2feb4ef57199","source":{"kind":"arxiv","id":"1808.06101","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06101","created_at":"2026-05-18T00:07:46Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06101v1","created_at":"2026-05-18T00:07:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06101","created_at":"2026-05-18T00:07:46Z"},{"alias_kind":"pith_short_12","alias_value":"AQ7FPHKWMXPW","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AQ7FPHKWMXPW7KZ3","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AQ7FPHKW","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AQ7FPHKWMXPW7KZ3B2SK2HZUJQ","target":"record","payload":{"canonical_record":{"source":{"id":"1808.06101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-18T16:37:49Z","cross_cats_sorted":[],"title_canon_sha256":"56090ed64e6c67608de657f55fafb7757b5011b9a810179dd1f9b8ea4ebdc4ee","abstract_canon_sha256":"0c8c21a9ba3814cfcda908388dca851a93bbb330a5794e807403901a5db69534"},"schema_version":"1.0"},"canonical_sha256":"043e579d5665df6fab3b0ea4ad1f344c16a4c7a8112807e695ed2feb4ef57199","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:46.104636Z","signature_b64":"9vJti2qZo5rReAs+ywlLiS2dkvd1SNiTAtvE6Fu7YaaIkKL8RbdGc6oP36RKuqCJSRAZpeJDGs6LD57GaJjzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"043e579d5665df6fab3b0ea4ad1f344c16a4c7a8112807e695ed2feb4ef57199","last_reissued_at":"2026-05-18T00:07:46.104009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:46.104009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.06101","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:07:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sIVFbVDoafhSW4N89QTdO1oSGRszkfaiZap+gvwSfD0ZF1TU4y3pdEy1uk/HQyKieOfiA2ZbLRmrDwGxIGCaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:46:04.874622Z"},"content_sha256":"15e1ab0cc500898bc30d52b0e6bd5fdc026f5ab0bb64a0736d33010dd97c0a4f","schema_version":"1.0","event_id":"sha256:15e1ab0cc500898bc30d52b0e6bd5fdc026f5ab0bb64a0736d33010dd97c0a4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AQ7FPHKWMXPW7KZ3B2SK2HZUJQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spanning tree packing, edge-connectivity and eigenvalues of graphs with given girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong-Jian Lai, Ruifang Liu, Yingzhi Tian","submitted_at":"2018-08-18T16:37:49Z","abstract_excerpt":"Let $\\tau(G)$ and $\\kappa'(G)$ denote the edge-connectivity and the spanning tree packing number of a graph $G$, respectively. Proving a conjecture initiated by Cioaba and Wong, Liu et al. in 2014 showed that for any simple graph $G$ with minimum degree $\\delta \\ge 2k \\ge 4$, if the second largest adjacency eigenvalue of $G$ satisfies $\\lambda_2(G) < \\delta - \\frac{2k-1}{\\delta+1}$, then $\\tau(G) \\ge k$. Similar results involving the Laplacian eigenvalues and the signless Laplacian eigenvalues of $G$ are also obtained. In this paper, we find a function $f(\\delta, k, g)$ such that for every gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06101","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:07:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UKGw52NYlCVH/3s7WBMQbbsnJLDQEESkA+XGYh5y21W4VW0kk/Z7p30hzgR8nl/nepJB5fEWw73yrXTbh8s8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:46:04.874975Z"},"content_sha256":"17c4b24e0d490add0bb265b64c70ec3d25b4131795194f1b83a0e1937adfcb07","schema_version":"1.0","event_id":"sha256:17c4b24e0d490add0bb265b64c70ec3d25b4131795194f1b83a0e1937adfcb07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AQ7FPHKWMXPW7KZ3B2SK2HZUJQ/bundle.json","state_url":"https://pith.science/pith/AQ7FPHKWMXPW7KZ3B2SK2HZUJQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AQ7FPHKWMXPW7KZ3B2SK2HZUJQ/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-03T04:46:04Z","links":{"resolver":"https://pith.science/pith/AQ7FPHKWMXPW7KZ3B2SK2HZUJQ","bundle":"https://pith.science/pith/AQ7FPHKWMXPW7KZ3B2SK2HZUJQ/bundle.json","state":"https://pith.science/pith/AQ7FPHKWMXPW7KZ3B2SK2HZUJQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AQ7FPHKWMXPW7KZ3B2SK2HZUJQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AQ7FPHKWMXPW7KZ3B2SK2HZUJQ","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":"0c8c21a9ba3814cfcda908388dca851a93bbb330a5794e807403901a5db69534","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-18T16:37:49Z","title_canon_sha256":"56090ed64e6c67608de657f55fafb7757b5011b9a810179dd1f9b8ea4ebdc4ee"},"schema_version":"1.0","source":{"id":"1808.06101","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06101","created_at":"2026-05-18T00:07:46Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06101v1","created_at":"2026-05-18T00:07:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06101","created_at":"2026-05-18T00:07:46Z"},{"alias_kind":"pith_short_12","alias_value":"AQ7FPHKWMXPW","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AQ7FPHKWMXPW7KZ3","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AQ7FPHKW","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:17c4b24e0d490add0bb265b64c70ec3d25b4131795194f1b83a0e1937adfcb07","target":"graph","created_at":"2026-05-18T00:07:46Z","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 $\\tau(G)$ and $\\kappa'(G)$ denote the edge-connectivity and the spanning tree packing number of a graph $G$, respectively. Proving a conjecture initiated by Cioaba and Wong, Liu et al. in 2014 showed that for any simple graph $G$ with minimum degree $\\delta \\ge 2k \\ge 4$, if the second largest adjacency eigenvalue of $G$ satisfies $\\lambda_2(G) < \\delta - \\frac{2k-1}{\\delta+1}$, then $\\tau(G) \\ge k$. Similar results involving the Laplacian eigenvalues and the signless Laplacian eigenvalues of $G$ are also obtained. In this paper, we find a function $f(\\delta, k, g)$ such that for every gra","authors_text":"Hong-Jian Lai, Ruifang Liu, Yingzhi Tian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-18T16:37:49Z","title":"Spanning tree packing, edge-connectivity and eigenvalues of graphs with given girth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06101","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:15e1ab0cc500898bc30d52b0e6bd5fdc026f5ab0bb64a0736d33010dd97c0a4f","target":"record","created_at":"2026-05-18T00:07:46Z","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":"0c8c21a9ba3814cfcda908388dca851a93bbb330a5794e807403901a5db69534","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-18T16:37:49Z","title_canon_sha256":"56090ed64e6c67608de657f55fafb7757b5011b9a810179dd1f9b8ea4ebdc4ee"},"schema_version":"1.0","source":{"id":"1808.06101","kind":"arxiv","version":1}},"canonical_sha256":"043e579d5665df6fab3b0ea4ad1f344c16a4c7a8112807e695ed2feb4ef57199","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"043e579d5665df6fab3b0ea4ad1f344c16a4c7a8112807e695ed2feb4ef57199","first_computed_at":"2026-05-18T00:07:46.104009Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:46.104009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9vJti2qZo5rReAs+ywlLiS2dkvd1SNiTAtvE6Fu7YaaIkKL8RbdGc6oP36RKuqCJSRAZpeJDGs6LD57GaJjzAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:46.104636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.06101","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15e1ab0cc500898bc30d52b0e6bd5fdc026f5ab0bb64a0736d33010dd97c0a4f","sha256:17c4b24e0d490add0bb265b64c70ec3d25b4131795194f1b83a0e1937adfcb07"],"state_sha256":"5c8ee2dad65ca59695c91615c027ddfa84127b0a97e6e1f79d885c9cca60066b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IYFTz3/itaQ0JAkT7tbGBjyvIlp4C7ytYbXsD/drd3YAWvDTDBLj2OGYs8/tGI8OlAVsmpwqs9wS3T07wX28CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:46:04.877480Z","bundle_sha256":"5ab21dfd94449b15f7f4570366fd6d1b8f2cfea95dd7e57548d20fb85d4c630d"}}