{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6T4EHOTAKFOVLIVQLW3JXYTJW3","short_pith_number":"pith:6T4EHOTA","canonical_record":{"source":{"id":"1702.05264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2017-02-17T09:13:41Z","cross_cats_sorted":[],"title_canon_sha256":"e946121dc61c283b30c30959e5b384fceccf73739575d38fff8d9e79461c78d4","abstract_canon_sha256":"a50d5202f6bd9f94d3b44d5e73e433217e6d895ae09f4b10c2c99bedcc58677a"},"schema_version":"1.0"},"canonical_sha256":"f4f843ba60515d55a2b05db69be269b6cf8af7aca91330dfcc1390a729418e98","source":{"kind":"arxiv","id":"1702.05264","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05264","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05264v1","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05264","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"6T4EHOTAKFOV","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6T4EHOTAKFOVLIVQ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6T4EHOTA","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6T4EHOTAKFOVLIVQLW3JXYTJW3","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2017-02-17T09:13:41Z","cross_cats_sorted":[],"title_canon_sha256":"e946121dc61c283b30c30959e5b384fceccf73739575d38fff8d9e79461c78d4","abstract_canon_sha256":"a50d5202f6bd9f94d3b44d5e73e433217e6d895ae09f4b10c2c99bedcc58677a"},"schema_version":"1.0"},"canonical_sha256":"f4f843ba60515d55a2b05db69be269b6cf8af7aca91330dfcc1390a729418e98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:33.102017Z","signature_b64":"1IITIegkW6bvhIzsJz9vj+aRHQZT2QkVeskrGs/o3/7rpx9j0Li2UYg3SrJ5tFjRloIUcBsfDS24OBRLHHsSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4f843ba60515d55a2b05db69be269b6cf8af7aca91330dfcc1390a729418e98","last_reissued_at":"2026-05-17T23:44:33.101331Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:33.101331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05264","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-17T23:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LBqOaxwlWoix+Mipe0u8JCC6glxv3+R5PKAYqv1kKcWkAh33qhvVby0TYzsOt+V2oENHhNvuRKP25L2LiIXODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:03:47.464280Z"},"content_sha256":"4cd238c79d9954a2690ccf8703667ed43fa4a6260a7c887264f0ae0d3364a071","schema_version":"1.0","event_id":"sha256:4cd238c79d9954a2690ccf8703667ed43fa4a6260a7c887264f0ae0d3364a071"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6T4EHOTAKFOVLIVQLW3JXYTJW3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Edge connectivity and the spectral gap of combinatorial and quantum graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Delio Mugnolo, Gregory Berkolaiko, James B. Kennedy, Pavel Kurasov","submitted_at":"2017-02-17T09:13:41Z","abstract_excerpt":"We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph disconnected. On combinatorial graphs, one of the bounds is the well-known inequality of Fiedler, of which we give a new variational proof. On quantum graphs, the corresponding bound generalizes a recent result of Band and L\\'evy. All proofs are general enough to yield corresponding estimates for the $p$-Laplacian and allow us to identify the minimizers.\n  Based on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05264","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-17T23:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r8O67lROwGN8UdIyS0ksjvY6YLbvkLNQLoX8Npke3qDwQZ+Ir8aTeKMlyT9/SEeHVdHghSYcK39GBlWPd2OBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:03:47.464647Z"},"content_sha256":"daeb56440e3df5403cf9b05d69bdc7fc1b4c2022622979e958d73643a1e2e751","schema_version":"1.0","event_id":"sha256:daeb56440e3df5403cf9b05d69bdc7fc1b4c2022622979e958d73643a1e2e751"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6T4EHOTAKFOVLIVQLW3JXYTJW3/bundle.json","state_url":"https://pith.science/pith/6T4EHOTAKFOVLIVQLW3JXYTJW3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6T4EHOTAKFOVLIVQLW3JXYTJW3/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-24T05:03:47Z","links":{"resolver":"https://pith.science/pith/6T4EHOTAKFOVLIVQLW3JXYTJW3","bundle":"https://pith.science/pith/6T4EHOTAKFOVLIVQLW3JXYTJW3/bundle.json","state":"https://pith.science/pith/6T4EHOTAKFOVLIVQLW3JXYTJW3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6T4EHOTAKFOVLIVQLW3JXYTJW3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6T4EHOTAKFOVLIVQLW3JXYTJW3","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":"a50d5202f6bd9f94d3b44d5e73e433217e6d895ae09f4b10c2c99bedcc58677a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2017-02-17T09:13:41Z","title_canon_sha256":"e946121dc61c283b30c30959e5b384fceccf73739575d38fff8d9e79461c78d4"},"schema_version":"1.0","source":{"id":"1702.05264","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05264","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05264v1","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05264","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"6T4EHOTAKFOV","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6T4EHOTAKFOVLIVQ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6T4EHOTA","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:daeb56440e3df5403cf9b05d69bdc7fc1b4c2022622979e958d73643a1e2e751","target":"graph","created_at":"2026-05-17T23:44:33Z","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":"We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph disconnected. On combinatorial graphs, one of the bounds is the well-known inequality of Fiedler, of which we give a new variational proof. On quantum graphs, the corresponding bound generalizes a recent result of Band and L\\'evy. All proofs are general enough to yield corresponding estimates for the $p$-Laplacian and allow us to identify the minimizers.\n  Based on ","authors_text":"Delio Mugnolo, Gregory Berkolaiko, James B. Kennedy, Pavel Kurasov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2017-02-17T09:13:41Z","title":"Edge connectivity and the spectral gap of combinatorial and quantum graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05264","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:4cd238c79d9954a2690ccf8703667ed43fa4a6260a7c887264f0ae0d3364a071","target":"record","created_at":"2026-05-17T23:44:33Z","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":"a50d5202f6bd9f94d3b44d5e73e433217e6d895ae09f4b10c2c99bedcc58677a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2017-02-17T09:13:41Z","title_canon_sha256":"e946121dc61c283b30c30959e5b384fceccf73739575d38fff8d9e79461c78d4"},"schema_version":"1.0","source":{"id":"1702.05264","kind":"arxiv","version":1}},"canonical_sha256":"f4f843ba60515d55a2b05db69be269b6cf8af7aca91330dfcc1390a729418e98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4f843ba60515d55a2b05db69be269b6cf8af7aca91330dfcc1390a729418e98","first_computed_at":"2026-05-17T23:44:33.101331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:33.101331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1IITIegkW6bvhIzsJz9vj+aRHQZT2QkVeskrGs/o3/7rpx9j0Li2UYg3SrJ5tFjRloIUcBsfDS24OBRLHHsSCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:33.102017Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05264","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4cd238c79d9954a2690ccf8703667ed43fa4a6260a7c887264f0ae0d3364a071","sha256:daeb56440e3df5403cf9b05d69bdc7fc1b4c2022622979e958d73643a1e2e751"],"state_sha256":"d38fbd11f6fd7132fe80c73bc2e782ab6ce815d49c1e24714ae7119e8431b890"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kamroU39Dg+k+HT3OVo3t8yuJQc26nicYzUaU0IwQqFg5D2/icaZGFRysd9ewlxHljRnE6df6a9kTpdRXOvKDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T05:03:47.466679Z","bundle_sha256":"1e206011284e29e0d6d7f00d16cb1c34d5bed86cff8c2499bcdd65f078974911"}}