{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:74HQIQT3JWK5DKVY5OWSRRTJZQ","short_pith_number":"pith:74HQIQT3","canonical_record":{"source":{"id":"2607.11061","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-13T03:58:41Z","cross_cats_sorted":[],"title_canon_sha256":"ff4012c1ee9cccf8e28f91644752d614f8a2eadff76608b140f45400a3094250","abstract_canon_sha256":"4a31fe4e06e32755aa8803222b7f56a6ede8901151c4d38722d2d9b50897dc91"},"schema_version":"1.0"},"canonical_sha256":"ff0f04427b4d95d1aab8ebad28c669cc0768ac7499c9f584a3bbf7d5fbc7dd0e","source":{"kind":"arxiv","id":"2607.11061","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.11061","created_at":"2026-07-14T01:22:14Z"},{"alias_kind":"arxiv_version","alias_value":"2607.11061v1","created_at":"2026-07-14T01:22:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.11061","created_at":"2026-07-14T01:22:14Z"},{"alias_kind":"pith_short_12","alias_value":"74HQIQT3JWK5","created_at":"2026-07-14T01:22:14Z"},{"alias_kind":"pith_short_16","alias_value":"74HQIQT3JWK5DKVY","created_at":"2026-07-14T01:22:14Z"},{"alias_kind":"pith_short_8","alias_value":"74HQIQT3","created_at":"2026-07-14T01:22:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:74HQIQT3JWK5DKVY5OWSRRTJZQ","target":"record","payload":{"canonical_record":{"source":{"id":"2607.11061","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-13T03:58:41Z","cross_cats_sorted":[],"title_canon_sha256":"ff4012c1ee9cccf8e28f91644752d614f8a2eadff76608b140f45400a3094250","abstract_canon_sha256":"4a31fe4e06e32755aa8803222b7f56a6ede8901151c4d38722d2d9b50897dc91"},"schema_version":"1.0"},"canonical_sha256":"ff0f04427b4d95d1aab8ebad28c669cc0768ac7499c9f584a3bbf7d5fbc7dd0e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:22:14.229878Z","signature_b64":"Gfszuet//BeUWB8rkcvNKYdDq5qY++wYVB/nXSs01eM42JfENn88hcRYfuM+/c6PZb1Ieatk4vRXljYdN7SqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff0f04427b4d95d1aab8ebad28c669cc0768ac7499c9f584a3bbf7d5fbc7dd0e","last_reissued_at":"2026-07-14T01:22:14.229057Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:22:14.229057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.11061","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-07-14T01:22:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yLmis7OtEFJIHS+n/0puoJdLq0SP354kSh8DueaUhyl2ZBTFr3vgRpjB1ijU+qTIv+tx/IOZ8xnMVgcjeasRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T15:17:42.304833Z"},"content_sha256":"30835171b4405e413d46e4d1c0246e89472c0b2cc7a8253e1b536f43d03e989a","schema_version":"1.0","event_id":"sha256:30835171b4405e413d46e4d1c0246e89472c0b2cc7a8253e1b536f43d03e989a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:74HQIQT3JWK5DKVY5OWSRRTJZQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight lower bound for the spectral radius of connected graphs with given matching number","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Li Tan, Xinmin Hou","submitted_at":"2026-07-13T03:58:41Z","abstract_excerpt":"Let $\\mathscr{G}_{n,k}$ denote the family of all connected graphs of order $n$ with matching number $k$. Liu, Lou, and Trevisan~(Linear Algebra Appl., 2026) posed the following problem: Determine the spectrally minimal graphs in $\\mathscr{G}_{n,k}$. In this paper we prove that for every graph $G \\in \\mathscr{G}_{n,k}$, $\n  \\rho(G) \\ge \\sqrt{\\frac{n + 2k - 3}{k}}, $\nand we completely characterize the extremal graphs when $k \\mid (n-3)$. As applications, we establish $\\rho(G) + k \\ge 3\\sqrt[3]{n/4}$ for $k \\ge 2$, settling the asymptotic order of $\\rho + k$ as $\\Theta(n^{1/3})$ -- strictly small"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.11061","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/2607.11061/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"},"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-07-14T01:22:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wk2glp2va3Jml2bZk8+5XzWRMNynJRMxsG602ewcRGK38agJg6pWDLOdsRQQsSiilvbg/VMZDwh52WyROAcHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T15:17:42.305317Z"},"content_sha256":"c10138afb1417569917103e2f5ed8613d69a0d542c0f46915e096f66898a05f9","schema_version":"1.0","event_id":"sha256:c10138afb1417569917103e2f5ed8613d69a0d542c0f46915e096f66898a05f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/74HQIQT3JWK5DKVY5OWSRRTJZQ/bundle.json","state_url":"https://pith.science/pith/74HQIQT3JWK5DKVY5OWSRRTJZQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/74HQIQT3JWK5DKVY5OWSRRTJZQ/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-08-14T15:17:42Z","links":{"resolver":"https://pith.science/pith/74HQIQT3JWK5DKVY5OWSRRTJZQ","bundle":"https://pith.science/pith/74HQIQT3JWK5DKVY5OWSRRTJZQ/bundle.json","state":"https://pith.science/pith/74HQIQT3JWK5DKVY5OWSRRTJZQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/74HQIQT3JWK5DKVY5OWSRRTJZQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:74HQIQT3JWK5DKVY5OWSRRTJZQ","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":"4a31fe4e06e32755aa8803222b7f56a6ede8901151c4d38722d2d9b50897dc91","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-13T03:58:41Z","title_canon_sha256":"ff4012c1ee9cccf8e28f91644752d614f8a2eadff76608b140f45400a3094250"},"schema_version":"1.0","source":{"id":"2607.11061","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.11061","created_at":"2026-07-14T01:22:14Z"},{"alias_kind":"arxiv_version","alias_value":"2607.11061v1","created_at":"2026-07-14T01:22:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.11061","created_at":"2026-07-14T01:22:14Z"},{"alias_kind":"pith_short_12","alias_value":"74HQIQT3JWK5","created_at":"2026-07-14T01:22:14Z"},{"alias_kind":"pith_short_16","alias_value":"74HQIQT3JWK5DKVY","created_at":"2026-07-14T01:22:14Z"},{"alias_kind":"pith_short_8","alias_value":"74HQIQT3","created_at":"2026-07-14T01:22:14Z"}],"graph_snapshots":[{"event_id":"sha256:c10138afb1417569917103e2f5ed8613d69a0d542c0f46915e096f66898a05f9","target":"graph","created_at":"2026-07-14T01:22:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.11061/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\mathscr{G}_{n,k}$ denote the family of all connected graphs of order $n$ with matching number $k$. Liu, Lou, and Trevisan~(Linear Algebra Appl., 2026) posed the following problem: Determine the spectrally minimal graphs in $\\mathscr{G}_{n,k}$. In this paper we prove that for every graph $G \\in \\mathscr{G}_{n,k}$, $\n  \\rho(G) \\ge \\sqrt{\\frac{n + 2k - 3}{k}}, $\nand we completely characterize the extremal graphs when $k \\mid (n-3)$. As applications, we establish $\\rho(G) + k \\ge 3\\sqrt[3]{n/4}$ for $k \\ge 2$, settling the asymptotic order of $\\rho + k$ as $\\Theta(n^{1/3})$ -- strictly small","authors_text":"Li Tan, Xinmin Hou","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-13T03:58:41Z","title":"Tight lower bound for the spectral radius of connected graphs with given matching number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.11061","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:30835171b4405e413d46e4d1c0246e89472c0b2cc7a8253e1b536f43d03e989a","target":"record","created_at":"2026-07-14T01:22:14Z","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":"4a31fe4e06e32755aa8803222b7f56a6ede8901151c4d38722d2d9b50897dc91","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-13T03:58:41Z","title_canon_sha256":"ff4012c1ee9cccf8e28f91644752d614f8a2eadff76608b140f45400a3094250"},"schema_version":"1.0","source":{"id":"2607.11061","kind":"arxiv","version":1}},"canonical_sha256":"ff0f04427b4d95d1aab8ebad28c669cc0768ac7499c9f584a3bbf7d5fbc7dd0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff0f04427b4d95d1aab8ebad28c669cc0768ac7499c9f584a3bbf7d5fbc7dd0e","first_computed_at":"2026-07-14T01:22:14.229057Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-14T01:22:14.229057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gfszuet//BeUWB8rkcvNKYdDq5qY++wYVB/nXSs01eM42JfENn88hcRYfuM+/c6PZb1Ieatk4vRXljYdN7SqCA==","signature_status":"signed_v1","signed_at":"2026-07-14T01:22:14.229878Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.11061","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30835171b4405e413d46e4d1c0246e89472c0b2cc7a8253e1b536f43d03e989a","sha256:c10138afb1417569917103e2f5ed8613d69a0d542c0f46915e096f66898a05f9"],"state_sha256":"24546e91ce4dc63bede2a6c93ba17e49140928ca93035e0a9b67616ce7ceb25b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XrI+84CVxMLuwk79S2Dc9/RJWiH0FecP5tzC8ra5De0/eOKIbr5qdTMTIUc97pDrZ69TrdGz6XibKqzH5uPlAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T15:17:42.309960Z","bundle_sha256":"206af79c266dc62bde0a67475df03643453dd9b06184fec7c7d3cee2546928d9"}}