{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HIBQPKWS7RWYM6OZCSNWG7XPY5","short_pith_number":"pith:HIBQPKWS","schema_version":"1.0","canonical_sha256":"3a0307aad2fc6d8679d9149b637eefc75790ac65a89251b31b4d02ec7dd54740","source":{"kind":"arxiv","id":"1805.12250","version":1},"attestation_state":"computed","paper":{"title":"Lower bounds for Laplacian spread and relations with invariant parameters revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.SP","authors_text":"Enide Andrade, Jonnathan Rodr\\'iguez, Maria Aguieiras A. de Freitas, Mar\\'ia Robbiano","submitted_at":"2018-05-30T22:34:49Z","abstract_excerpt":"Let $G=\\left( V\\left( G\\right) ,E\\left( G\\right) \\right) $ be an $\\left( n,m\\right) $-graph and $X$ a nonempty proper subset of $V\\left( G\\right) $. Let $X^{c}=V\\left( G\\right) \\backslash X$.\\ The edge density of $X$ in $G$ is given by \\begin{equation*} \\rho _{G}\\left( X\\right) =\\frac{n\\left\\vert E_{X}\\left( G\\right) \\right\\vert }{\\left\\vert X\\right\\vert \\left\\vert X^{c}\\right\\vert }, \\end{equation*} where $E_{X}\\left( G\\right) \\ $ is the set of edges in $G$ with one end in $% X $ and the other in $X^{c}$. The Laplacian spread of a graph is the difference between the greatest Laplacian eigenva"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1805.12250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2018-05-30T22:34:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6354c313950b75fe9840b35adc3b3c92e77c83d013ea05cc1f4484abeb9c14fb","abstract_canon_sha256":"b513f357b7dc11539ea2d619032855c876130f7a463ab1131550aa848d3d81a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:30.937710Z","signature_b64":"P0oLuBfnw4mcftaBDM+FknptzcatuJKY29sB8/R4lyTXvvxJUdxcp2YMCorjqNqekJfhu+l30gTLEYanCkL7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a0307aad2fc6d8679d9149b637eefc75790ac65a89251b31b4d02ec7dd54740","last_reissued_at":"2026-05-18T00:14:30.937168Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:30.937168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds for Laplacian spread and relations with invariant parameters revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.SP","authors_text":"Enide Andrade, Jonnathan Rodr\\'iguez, Maria Aguieiras A. de Freitas, Mar\\'ia Robbiano","submitted_at":"2018-05-30T22:34:49Z","abstract_excerpt":"Let $G=\\left( V\\left( G\\right) ,E\\left( G\\right) \\right) $ be an $\\left( n,m\\right) $-graph and $X$ a nonempty proper subset of $V\\left( G\\right) $. Let $X^{c}=V\\left( G\\right) \\backslash X$.\\ The edge density of $X$ in $G$ is given by \\begin{equation*} \\rho _{G}\\left( X\\right) =\\frac{n\\left\\vert E_{X}\\left( G\\right) \\right\\vert }{\\left\\vert X\\right\\vert \\left\\vert X^{c}\\right\\vert }, \\end{equation*} where $E_{X}\\left( G\\right) \\ $ is the set of edges in $G$ with one end in $% X $ and the other in $X^{c}$. The Laplacian spread of a graph is the difference between the greatest Laplacian eigenva"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.12250","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.12250","created_at":"2026-05-18T00:14:30.937250+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.12250v1","created_at":"2026-05-18T00:14:30.937250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12250","created_at":"2026-05-18T00:14:30.937250+00:00"},{"alias_kind":"pith_short_12","alias_value":"HIBQPKWS7RWY","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HIBQPKWS7RWYM6OZ","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HIBQPKWS","created_at":"2026-05-18T12:32:28.185984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HIBQPKWS7RWYM6OZCSNWG7XPY5","json":"https://pith.science/pith/HIBQPKWS7RWYM6OZCSNWG7XPY5.json","graph_json":"https://pith.science/api/pith-number/HIBQPKWS7RWYM6OZCSNWG7XPY5/graph.json","events_json":"https://pith.science/api/pith-number/HIBQPKWS7RWYM6OZCSNWG7XPY5/events.json","paper":"https://pith.science/paper/HIBQPKWS"},"agent_actions":{"view_html":"https://pith.science/pith/HIBQPKWS7RWYM6OZCSNWG7XPY5","download_json":"https://pith.science/pith/HIBQPKWS7RWYM6OZCSNWG7XPY5.json","view_paper":"https://pith.science/paper/HIBQPKWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.12250&json=true","fetch_graph":"https://pith.science/api/pith-number/HIBQPKWS7RWYM6OZCSNWG7XPY5/graph.json","fetch_events":"https://pith.science/api/pith-number/HIBQPKWS7RWYM6OZCSNWG7XPY5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HIBQPKWS7RWYM6OZCSNWG7XPY5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HIBQPKWS7RWYM6OZCSNWG7XPY5/action/storage_attestation","attest_author":"https://pith.science/pith/HIBQPKWS7RWYM6OZCSNWG7XPY5/action/author_attestation","sign_citation":"https://pith.science/pith/HIBQPKWS7RWYM6OZCSNWG7XPY5/action/citation_signature","submit_replication":"https://pith.science/pith/HIBQPKWS7RWYM6OZCSNWG7XPY5/action/replication_record"}},"created_at":"2026-05-18T00:14:30.937250+00:00","updated_at":"2026-05-18T00:14:30.937250+00:00"}