{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:IW3UIEVIBYPK3RNHJTPN6DODZQ","short_pith_number":"pith:IW3UIEVI","schema_version":"1.0","canonical_sha256":"45b74412a80e1eadc5a74cdedf0dc3cc3aeb068c56250086947784fc69f01ee6","source":{"kind":"arxiv","id":"1005.4322","version":2},"attestation_state":"computed","paper":{"title":"Level sets percolation on chaotic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MP","nlin.CD"],"primary_cat":"math-ph","authors_text":"Uzy Smilansky, Yehonatan Elon","submitted_at":"2010-05-24T12:56:35Z","abstract_excerpt":"One of the most surprising discoveries in quantum chaos was that nodal domains of eigenfunctions of quantum-chaotic billiards and maps in the semi-classical limit display critical percolation. Here we extend these studies to the level sets of the adjacency eigenvectors of d-regular graphs. Numerical computations show that the statistics of the largest level sets (the maximal connected components of the graph for which the eigenvector exceeds a prescribed value) depend critically on the level. The critical level is a function of the eigenvalue and the degree d. To explain the observed behavior "},"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":"1005.4322","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2010-05-24T12:56:35Z","cross_cats_sorted":["math.MP","nlin.CD"],"title_canon_sha256":"1d48e634953b85bcba05a9970b58e772bdd535b689be1c25adcf8f3c55f0a3ab","abstract_canon_sha256":"c8805ed519c98590685f17223056dc8353e134a18cbe746b97bef12a7290ef7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:56.213604Z","signature_b64":"7k0mW0v1zygVi0I4pquWZiB9u3kkVPDbXkGRessQwSPhMbnEuFasHCKub33kPjUnfrzL4aYUyzmE1NWyOh1/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45b74412a80e1eadc5a74cdedf0dc3cc3aeb068c56250086947784fc69f01ee6","last_reissued_at":"2026-05-18T02:23:56.212849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:56.212849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Level sets percolation on chaotic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MP","nlin.CD"],"primary_cat":"math-ph","authors_text":"Uzy Smilansky, Yehonatan Elon","submitted_at":"2010-05-24T12:56:35Z","abstract_excerpt":"One of the most surprising discoveries in quantum chaos was that nodal domains of eigenfunctions of quantum-chaotic billiards and maps in the semi-classical limit display critical percolation. Here we extend these studies to the level sets of the adjacency eigenvectors of d-regular graphs. Numerical computations show that the statistics of the largest level sets (the maximal connected components of the graph for which the eigenvector exceeds a prescribed value) depend critically on the level. The critical level is a function of the eigenvalue and the degree d. To explain the observed behavior "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.4322","kind":"arxiv","version":2},"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":"1005.4322","created_at":"2026-05-18T02:23:56.212965+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.4322v2","created_at":"2026-05-18T02:23:56.212965+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.4322","created_at":"2026-05-18T02:23:56.212965+00:00"},{"alias_kind":"pith_short_12","alias_value":"IW3UIEVIBYPK","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"IW3UIEVIBYPK3RNH","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"IW3UIEVI","created_at":"2026-05-18T12:26:09.077623+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/IW3UIEVIBYPK3RNHJTPN6DODZQ","json":"https://pith.science/pith/IW3UIEVIBYPK3RNHJTPN6DODZQ.json","graph_json":"https://pith.science/api/pith-number/IW3UIEVIBYPK3RNHJTPN6DODZQ/graph.json","events_json":"https://pith.science/api/pith-number/IW3UIEVIBYPK3RNHJTPN6DODZQ/events.json","paper":"https://pith.science/paper/IW3UIEVI"},"agent_actions":{"view_html":"https://pith.science/pith/IW3UIEVIBYPK3RNHJTPN6DODZQ","download_json":"https://pith.science/pith/IW3UIEVIBYPK3RNHJTPN6DODZQ.json","view_paper":"https://pith.science/paper/IW3UIEVI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.4322&json=true","fetch_graph":"https://pith.science/api/pith-number/IW3UIEVIBYPK3RNHJTPN6DODZQ/graph.json","fetch_events":"https://pith.science/api/pith-number/IW3UIEVIBYPK3RNHJTPN6DODZQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IW3UIEVIBYPK3RNHJTPN6DODZQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IW3UIEVIBYPK3RNHJTPN6DODZQ/action/storage_attestation","attest_author":"https://pith.science/pith/IW3UIEVIBYPK3RNHJTPN6DODZQ/action/author_attestation","sign_citation":"https://pith.science/pith/IW3UIEVIBYPK3RNHJTPN6DODZQ/action/citation_signature","submit_replication":"https://pith.science/pith/IW3UIEVIBYPK3RNHJTPN6DODZQ/action/replication_record"}},"created_at":"2026-05-18T02:23:56.212965+00:00","updated_at":"2026-05-18T02:23:56.212965+00:00"}