{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:KEH5A75J6AAG2KRXR2DU6UIEJB","short_pith_number":"pith:KEH5A75J","canonical_record":{"source":{"id":"2506.00921","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-01T09:24:24Z","cross_cats_sorted":[],"title_canon_sha256":"31bbb4ad8fd8f8b0fd4b8f767d10b83c222b1eb7364b6b59b2f6086f0ccb030a","abstract_canon_sha256":"443f97626ee0ebdba7a50af245d5dd9e6646a700d88d69415661838a598b755e"},"schema_version":"1.0"},"canonical_sha256":"510fd07fa9f0006d2a378e874f510448466f856b769c61c2d74c741e9686870f","source":{"kind":"arxiv","id":"2506.00921","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.00921","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"arxiv_version","alias_value":"2506.00921v1","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00921","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"pith_short_12","alias_value":"KEH5A75J6AAG","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"pith_short_16","alias_value":"KEH5A75J6AAG2KRX","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"pith_short_8","alias_value":"KEH5A75J","created_at":"2026-07-05T11:13:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:KEH5A75J6AAG2KRXR2DU6UIEJB","target":"record","payload":{"canonical_record":{"source":{"id":"2506.00921","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-01T09:24:24Z","cross_cats_sorted":[],"title_canon_sha256":"31bbb4ad8fd8f8b0fd4b8f767d10b83c222b1eb7364b6b59b2f6086f0ccb030a","abstract_canon_sha256":"443f97626ee0ebdba7a50af245d5dd9e6646a700d88d69415661838a598b755e"},"schema_version":"1.0"},"canonical_sha256":"510fd07fa9f0006d2a378e874f510448466f856b769c61c2d74c741e9686870f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:42.857840Z","signature_b64":"33s2cAOO09WpSjJZqqrqdP6wkYwE8m8iLBR6Csai8FIniSjzXksVRQ6oaR32vOiKBg5MGvJyzf314852MK4HAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"510fd07fa9f0006d2a378e874f510448466f856b769c61c2d74c741e9686870f","last_reissued_at":"2026-07-05T11:13:42.857336Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:42.857336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.00921","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-05T11:13:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bKLpOljvT/HZ1HfGwgX3gctc21T5EQKJERrNY7k93MrFscRnce6afY74XBgR4dpF68a6VRHg2vx2DJ1gtVcFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:13:14.647054Z"},"content_sha256":"bd069cf2a33847fef29dd61d23469c2d12e1526c648c193ddd0b0b7e93cd2b5c","schema_version":"1.0","event_id":"sha256:bd069cf2a33847fef29dd61d23469c2d12e1526c648c193ddd0b0b7e93cd2b5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:KEH5A75J6AAG2KRXR2DU6UIEJB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Girth and Laplacian eigenvalue distribution","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Zhou, Leyou Xu","submitted_at":"2025-06-01T09:24:24Z","abstract_excerpt":"Let $G$ be a connected graph of order $n$ with girth $g$. For $k=1,\\dots,\\min\\{g-1, n-g\\}$, let $n(G,k)$ be the number of Laplacian eigenvalues (counting multiplicities) of $G$ that fall inside the interval $[n-g-k+4,n]$. We prove that if $g\\ge 4$, then \\[ n(G,k)\\le n-g. \\] Those graphs achieving the bound for $k=1,2$ are determined. We also determine the graphs $G$ with $g=3$ such that $n(G,k)=n-1, n-2, n-3$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00921","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/2506.00921/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-05T11:13:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cj5V78eZNNT8zkLof5E9BH/R43d2ysFLy+9lzNUybyMwSU/3tIKCRk2HY6PTKkM6p1/Rq91anrd5Yei108ubBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:13:14.647563Z"},"content_sha256":"c6329e5f93ded23eee8cbc11e886950fbda5bc927492053c69afe8f613f7a612","schema_version":"1.0","event_id":"sha256:c6329e5f93ded23eee8cbc11e886950fbda5bc927492053c69afe8f613f7a612"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KEH5A75J6AAG2KRXR2DU6UIEJB/bundle.json","state_url":"https://pith.science/pith/KEH5A75J6AAG2KRXR2DU6UIEJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KEH5A75J6AAG2KRXR2DU6UIEJB/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-11T01:13:14Z","links":{"resolver":"https://pith.science/pith/KEH5A75J6AAG2KRXR2DU6UIEJB","bundle":"https://pith.science/pith/KEH5A75J6AAG2KRXR2DU6UIEJB/bundle.json","state":"https://pith.science/pith/KEH5A75J6AAG2KRXR2DU6UIEJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KEH5A75J6AAG2KRXR2DU6UIEJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KEH5A75J6AAG2KRXR2DU6UIEJB","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":"443f97626ee0ebdba7a50af245d5dd9e6646a700d88d69415661838a598b755e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-01T09:24:24Z","title_canon_sha256":"31bbb4ad8fd8f8b0fd4b8f767d10b83c222b1eb7364b6b59b2f6086f0ccb030a"},"schema_version":"1.0","source":{"id":"2506.00921","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.00921","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"arxiv_version","alias_value":"2506.00921v1","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00921","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"pith_short_12","alias_value":"KEH5A75J6AAG","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"pith_short_16","alias_value":"KEH5A75J6AAG2KRX","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"pith_short_8","alias_value":"KEH5A75J","created_at":"2026-07-05T11:13:42Z"}],"graph_snapshots":[{"event_id":"sha256:c6329e5f93ded23eee8cbc11e886950fbda5bc927492053c69afe8f613f7a612","target":"graph","created_at":"2026-07-05T11:13:42Z","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/2506.00921/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a connected graph of order $n$ with girth $g$. For $k=1,\\dots,\\min\\{g-1, n-g\\}$, let $n(G,k)$ be the number of Laplacian eigenvalues (counting multiplicities) of $G$ that fall inside the interval $[n-g-k+4,n]$. We prove that if $g\\ge 4$, then \\[ n(G,k)\\le n-g. \\] Those graphs achieving the bound for $k=1,2$ are determined. We also determine the graphs $G$ with $g=3$ such that $n(G,k)=n-1, n-2, n-3$.","authors_text":"Bo Zhou, Leyou Xu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-01T09:24:24Z","title":"Girth and Laplacian eigenvalue distribution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00921","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:bd069cf2a33847fef29dd61d23469c2d12e1526c648c193ddd0b0b7e93cd2b5c","target":"record","created_at":"2026-07-05T11:13:42Z","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":"443f97626ee0ebdba7a50af245d5dd9e6646a700d88d69415661838a598b755e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-01T09:24:24Z","title_canon_sha256":"31bbb4ad8fd8f8b0fd4b8f767d10b83c222b1eb7364b6b59b2f6086f0ccb030a"},"schema_version":"1.0","source":{"id":"2506.00921","kind":"arxiv","version":1}},"canonical_sha256":"510fd07fa9f0006d2a378e874f510448466f856b769c61c2d74c741e9686870f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"510fd07fa9f0006d2a378e874f510448466f856b769c61c2d74c741e9686870f","first_computed_at":"2026-07-05T11:13:42.857336Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:13:42.857336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"33s2cAOO09WpSjJZqqrqdP6wkYwE8m8iLBR6Csai8FIniSjzXksVRQ6oaR32vOiKBg5MGvJyzf314852MK4HAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:13:42.857840Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.00921","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd069cf2a33847fef29dd61d23469c2d12e1526c648c193ddd0b0b7e93cd2b5c","sha256:c6329e5f93ded23eee8cbc11e886950fbda5bc927492053c69afe8f613f7a612"],"state_sha256":"9b66b2571a98f0a2a4d337701063dbe121caaa23541d73b93cc858c0f9ebf8cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8pLTQQOrSiam6HE+mI1FzZOrtP5YytimNKjMvg795ZhP4ERDmyIQuJ/ZA/u71FK0Y8LRcMTUv2Yobj1IYfTYDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T01:13:14.694320Z","bundle_sha256":"952c63a9a5defdd636491d8874cd7fdd31c9e685d3bd458911e5f128e7ff0a16"}}