{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EFDODLCQPGJQH6DCQXZDEYBHM4","short_pith_number":"pith:EFDODLCQ","canonical_record":{"source":{"id":"1907.04798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-10T15:35:46Z","cross_cats_sorted":[],"title_canon_sha256":"370a7b4156d77e8f347fb06870727a0053633ae980bbd24465283e36526070ff","abstract_canon_sha256":"c030fe188f0dc847271f86594953744da1d892585afcd843cdb6433dc326c3ec"},"schema_version":"1.0"},"canonical_sha256":"2146e1ac50799303f86285f2326027670e16ed412a761577425162e703bd584d","source":{"kind":"arxiv","id":"1907.04798","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04798","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04798v1","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04798","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"EFDODLCQPGJQ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EFDODLCQPGJQH6DC","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EFDODLCQ","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EFDODLCQPGJQH6DCQXZDEYBHM4","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-10T15:35:46Z","cross_cats_sorted":[],"title_canon_sha256":"370a7b4156d77e8f347fb06870727a0053633ae980bbd24465283e36526070ff","abstract_canon_sha256":"c030fe188f0dc847271f86594953744da1d892585afcd843cdb6433dc326c3ec"},"schema_version":"1.0"},"canonical_sha256":"2146e1ac50799303f86285f2326027670e16ed412a761577425162e703bd584d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:56.721957Z","signature_b64":"rYprF9xyIUO7v4T1c8VlqHi46rXzeiFQbDLrdyvjmUariFsnnSkG+CItingSKgjDoeaB2Sj1cdHL9+4Q1VpFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2146e1ac50799303f86285f2326027670e16ed412a761577425162e703bd584d","last_reissued_at":"2026-05-17T23:40:56.721339Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:56.721339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04798","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:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SxP9mXO+0XK853diL+mzdRCaM252cNbtphunpAb9gUd9NFVXdZODjcOy2g/4SJBhIM+lBK9Gw8yhpDiIn7B1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:08:16.753203Z"},"content_sha256":"63abf58f1c70998bb7b3db9692c6942c0d4f4e1a973f7f2f774f3de4d4c9554f","schema_version":"1.0","event_id":"sha256:63abf58f1c70998bb7b3db9692c6942c0d4f4e1a973f7f2f774f3de4d4c9554f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EFDODLCQPGJQH6DCQXZDEYBHM4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The least signless Laplacian eigenvalue of the complements of bicyclic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guoping Wang, Xiaoyun Feng","submitted_at":"2019-07-10T15:35:46Z","abstract_excerpt":"Suppose that $G$ is a connected simple graph with the vertex set $V(G)=\\{v_1, v_2,\\cdots,v_n\\}$. Then the adjacency matrix of $G$ is $A(G)=(a_{ij})_{n\\times n}$, where $a_{ij}=1$ if $v_i$ is adjacent to $v_j$, and otherwise $a_{ij}=0$. The degree matrix $D(G)=diag(d_{G}(v_1), d_{G}(v_2), \\dots, d_{G}(v_n)),$ where $d_{G}(v_i)$ denotes the degree of $v_i$ in the graph $G$ ($1\\leq i\\leq n$). The matrix $Q(G)=D(G)+A(G)$ is called the signless Laplacian matrix of $G$. The least eigenvalue of $Q(G)$ is also called the least signless Laplacian eigenvalue of $G$. In this paper we give two graft trans"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04798","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:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eCphQVXrcKFxu6uqmkHJNpH1lG8OpMXHLblV8+q3ux1ER+YWoxF83CnE6723MboU3T35nlAI1euAESJREuumCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:08:16.753811Z"},"content_sha256":"cb2f43d56c3ef8aef4600718183dd135ecaaa8c7e5eec12350411dbe00b41e24","schema_version":"1.0","event_id":"sha256:cb2f43d56c3ef8aef4600718183dd135ecaaa8c7e5eec12350411dbe00b41e24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EFDODLCQPGJQH6DCQXZDEYBHM4/bundle.json","state_url":"https://pith.science/pith/EFDODLCQPGJQH6DCQXZDEYBHM4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EFDODLCQPGJQH6DCQXZDEYBHM4/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-05-29T17:08:16Z","links":{"resolver":"https://pith.science/pith/EFDODLCQPGJQH6DCQXZDEYBHM4","bundle":"https://pith.science/pith/EFDODLCQPGJQH6DCQXZDEYBHM4/bundle.json","state":"https://pith.science/pith/EFDODLCQPGJQH6DCQXZDEYBHM4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EFDODLCQPGJQH6DCQXZDEYBHM4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EFDODLCQPGJQH6DCQXZDEYBHM4","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":"c030fe188f0dc847271f86594953744da1d892585afcd843cdb6433dc326c3ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-10T15:35:46Z","title_canon_sha256":"370a7b4156d77e8f347fb06870727a0053633ae980bbd24465283e36526070ff"},"schema_version":"1.0","source":{"id":"1907.04798","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04798","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04798v1","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04798","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"EFDODLCQPGJQ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EFDODLCQPGJQH6DC","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EFDODLCQ","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:cb2f43d56c3ef8aef4600718183dd135ecaaa8c7e5eec12350411dbe00b41e24","target":"graph","created_at":"2026-05-17T23:40:56Z","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":"Suppose that $G$ is a connected simple graph with the vertex set $V(G)=\\{v_1, v_2,\\cdots,v_n\\}$. Then the adjacency matrix of $G$ is $A(G)=(a_{ij})_{n\\times n}$, where $a_{ij}=1$ if $v_i$ is adjacent to $v_j$, and otherwise $a_{ij}=0$. The degree matrix $D(G)=diag(d_{G}(v_1), d_{G}(v_2), \\dots, d_{G}(v_n)),$ where $d_{G}(v_i)$ denotes the degree of $v_i$ in the graph $G$ ($1\\leq i\\leq n$). The matrix $Q(G)=D(G)+A(G)$ is called the signless Laplacian matrix of $G$. The least eigenvalue of $Q(G)$ is also called the least signless Laplacian eigenvalue of $G$. In this paper we give two graft trans","authors_text":"Guoping Wang, Xiaoyun Feng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-10T15:35:46Z","title":"The least signless Laplacian eigenvalue of the complements of bicyclic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04798","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:63abf58f1c70998bb7b3db9692c6942c0d4f4e1a973f7f2f774f3de4d4c9554f","target":"record","created_at":"2026-05-17T23:40:56Z","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":"c030fe188f0dc847271f86594953744da1d892585afcd843cdb6433dc326c3ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-10T15:35:46Z","title_canon_sha256":"370a7b4156d77e8f347fb06870727a0053633ae980bbd24465283e36526070ff"},"schema_version":"1.0","source":{"id":"1907.04798","kind":"arxiv","version":1}},"canonical_sha256":"2146e1ac50799303f86285f2326027670e16ed412a761577425162e703bd584d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2146e1ac50799303f86285f2326027670e16ed412a761577425162e703bd584d","first_computed_at":"2026-05-17T23:40:56.721339Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:56.721339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rYprF9xyIUO7v4T1c8VlqHi46rXzeiFQbDLrdyvjmUariFsnnSkG+CItingSKgjDoeaB2Sj1cdHL9+4Q1VpFAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:56.721957Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04798","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63abf58f1c70998bb7b3db9692c6942c0d4f4e1a973f7f2f774f3de4d4c9554f","sha256:cb2f43d56c3ef8aef4600718183dd135ecaaa8c7e5eec12350411dbe00b41e24"],"state_sha256":"f0c8d86746cdd0072a145f3e71876c997d24d830ee817c52026229c69e862043"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u6TjDeKkycXDcRf40oloQ5AOgNYPak//0jyzWa0L10GNGAXPrkyUCIY0XHDOxO0fm40PCFdcxR/eWUxet7RQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:08:16.756108Z","bundle_sha256":"15f95d8623024028829e016ce1af3b97267e1ddbf721a14e5588524819eac519"}}