{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:P4ZZUW3NTIFKIJ7Q7CSWKQRA62","short_pith_number":"pith:P4ZZUW3N","schema_version":"1.0","canonical_sha256":"7f339a5b6d9a0aa427f0f8a5654220f69dacab83efa92d587cdeb28deb0522f6","source":{"kind":"arxiv","id":"1602.07472","version":1},"attestation_state":"computed","paper":{"title":"Nodal Domains of Eigenvectors for $1$-Laplacian on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Dong Zhang, K.C. Chang, Sihong Shao","submitted_at":"2016-02-24T11:41:43Z","abstract_excerpt":"The eigenvectors for graph $1$-Laplacian possess some sort of localization property: On one hand, any nodal domain of an eigenvector is again an eigenvector with the same eigenvalue; on the other hand, one can pack up an eigenvector for a new graph by several fundamental eigencomponents and modules with the same eigenvalue via few special techniques. The Courant nodal domain theorem for graphs is extended to graph $1$-Laplacian for strong nodal domains, but for weak nodal domains it is false. The notion of algebraic multiplicity is introduced in order to provide a more precise estimate of the "},"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":"1602.07472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2016-02-24T11:41:43Z","cross_cats_sorted":[],"title_canon_sha256":"c7fe77fa890013efa5fb360637decf00731231cf39e75d4760af08843946fbe5","abstract_canon_sha256":"253ed1a7458c0942777e7910b9ffa94b37e2d4e155d4dffd78a987575eaef69d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:34.583280Z","signature_b64":"MjapTjgndw/huLjN3EqO+WTF+RTge8lq/XvibWuIUwMHuAodYtSROIuHLdXq+glHxX/rVsfsT8oOQxg4RMpNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f339a5b6d9a0aa427f0f8a5654220f69dacab83efa92d587cdeb28deb0522f6","last_reissued_at":"2026-05-18T00:53:34.582758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:34.582758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nodal Domains of Eigenvectors for $1$-Laplacian on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Dong Zhang, K.C. Chang, Sihong Shao","submitted_at":"2016-02-24T11:41:43Z","abstract_excerpt":"The eigenvectors for graph $1$-Laplacian possess some sort of localization property: On one hand, any nodal domain of an eigenvector is again an eigenvector with the same eigenvalue; on the other hand, one can pack up an eigenvector for a new graph by several fundamental eigencomponents and modules with the same eigenvalue via few special techniques. The Courant nodal domain theorem for graphs is extended to graph $1$-Laplacian for strong nodal domains, but for weak nodal domains it is false. The notion of algebraic multiplicity is introduced in order to provide a more precise estimate of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07472","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":"1602.07472","created_at":"2026-05-18T00:53:34.582829+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07472v1","created_at":"2026-05-18T00:53:34.582829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07472","created_at":"2026-05-18T00:53:34.582829+00:00"},{"alias_kind":"pith_short_12","alias_value":"P4ZZUW3NTIFK","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"P4ZZUW3NTIFKIJ7Q","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"P4ZZUW3N","created_at":"2026-05-18T12:30:36.002864+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/P4ZZUW3NTIFKIJ7Q7CSWKQRA62","json":"https://pith.science/pith/P4ZZUW3NTIFKIJ7Q7CSWKQRA62.json","graph_json":"https://pith.science/api/pith-number/P4ZZUW3NTIFKIJ7Q7CSWKQRA62/graph.json","events_json":"https://pith.science/api/pith-number/P4ZZUW3NTIFKIJ7Q7CSWKQRA62/events.json","paper":"https://pith.science/paper/P4ZZUW3N"},"agent_actions":{"view_html":"https://pith.science/pith/P4ZZUW3NTIFKIJ7Q7CSWKQRA62","download_json":"https://pith.science/pith/P4ZZUW3NTIFKIJ7Q7CSWKQRA62.json","view_paper":"https://pith.science/paper/P4ZZUW3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07472&json=true","fetch_graph":"https://pith.science/api/pith-number/P4ZZUW3NTIFKIJ7Q7CSWKQRA62/graph.json","fetch_events":"https://pith.science/api/pith-number/P4ZZUW3NTIFKIJ7Q7CSWKQRA62/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P4ZZUW3NTIFKIJ7Q7CSWKQRA62/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P4ZZUW3NTIFKIJ7Q7CSWKQRA62/action/storage_attestation","attest_author":"https://pith.science/pith/P4ZZUW3NTIFKIJ7Q7CSWKQRA62/action/author_attestation","sign_citation":"https://pith.science/pith/P4ZZUW3NTIFKIJ7Q7CSWKQRA62/action/citation_signature","submit_replication":"https://pith.science/pith/P4ZZUW3NTIFKIJ7Q7CSWKQRA62/action/replication_record"}},"created_at":"2026-05-18T00:53:34.582829+00:00","updated_at":"2026-05-18T00:53:34.582829+00:00"}