{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DK72BGAA3LX4WFKBEY2MX2FVX5","short_pith_number":"pith:DK72BGAA","schema_version":"1.0","canonical_sha256":"1abfa09800daefcb15412634cbe8b5bf56c0b4a1a58023dfcb5672112f0f5199","source":{"kind":"arxiv","id":"2411.14314","version":1},"attestation_state":"computed","paper":{"title":"Switching Graph Matrix Norm Bounds: from i.i.d. to Random Regular Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jeff Xu","submitted_at":"2024-11-21T17:06:53Z","abstract_excerpt":"In this work, we give novel spectral norm bounds for graph matrix on inputs being random regular graphs. Graph matrix is a family of random matrices with entries given by polynomial functions of the underlying input. These matrices have been known to be the backbone for the analysis of various average-case algorithms and hardness. Previous investigations of such matrices are largely restricted to the \\Erdos-\\Renyi model, and tight matrix norm bounds on regular graphs are only known for specific examples. We unite these two lines of investigations, and give the first result departing from 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":"2411.14314","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-11-21T17:06:53Z","cross_cats_sorted":[],"title_canon_sha256":"990b964f4d1f42edfd03400c4968c14859886fb3ba1e2c6ea70e9d1c7d45ac3c","abstract_canon_sha256":"1db7167dddec9125326b30b062720bb8e4c35e96a187dba4ae4df4fe628bfae8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:45.132270Z","signature_b64":"3GTvGjR50QynBh+zGdZ1fyX87b4EKbBGvd3BeV9FBkS/kJp8Mn9CWGBrbmlEiWtagXrydDxy3g5tgADTOpqDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1abfa09800daefcb15412634cbe8b5bf56c0b4a1a58023dfcb5672112f0f5199","last_reissued_at":"2026-07-05T09:38:45.131858Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:45.131858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Switching Graph Matrix Norm Bounds: from i.i.d. to Random Regular Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jeff Xu","submitted_at":"2024-11-21T17:06:53Z","abstract_excerpt":"In this work, we give novel spectral norm bounds for graph matrix on inputs being random regular graphs. Graph matrix is a family of random matrices with entries given by polynomial functions of the underlying input. These matrices have been known to be the backbone for the analysis of various average-case algorithms and hardness. Previous investigations of such matrices are largely restricted to the \\Erdos-\\Renyi model, and tight matrix norm bounds on regular graphs are only known for specific examples. We unite these two lines of investigations, and give the first result departing from the \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14314","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.14314/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.14314","created_at":"2026-07-05T09:38:45.131915+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14314v1","created_at":"2026-07-05T09:38:45.131915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14314","created_at":"2026-07-05T09:38:45.131915+00:00"},{"alias_kind":"pith_short_12","alias_value":"DK72BGAA3LX4","created_at":"2026-07-05T09:38:45.131915+00:00"},{"alias_kind":"pith_short_16","alias_value":"DK72BGAA3LX4WFKB","created_at":"2026-07-05T09:38:45.131915+00:00"},{"alias_kind":"pith_short_8","alias_value":"DK72BGAA","created_at":"2026-07-05T09:38:45.131915+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/DK72BGAA3LX4WFKBEY2MX2FVX5","json":"https://pith.science/pith/DK72BGAA3LX4WFKBEY2MX2FVX5.json","graph_json":"https://pith.science/api/pith-number/DK72BGAA3LX4WFKBEY2MX2FVX5/graph.json","events_json":"https://pith.science/api/pith-number/DK72BGAA3LX4WFKBEY2MX2FVX5/events.json","paper":"https://pith.science/paper/DK72BGAA"},"agent_actions":{"view_html":"https://pith.science/pith/DK72BGAA3LX4WFKBEY2MX2FVX5","download_json":"https://pith.science/pith/DK72BGAA3LX4WFKBEY2MX2FVX5.json","view_paper":"https://pith.science/paper/DK72BGAA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14314&json=true","fetch_graph":"https://pith.science/api/pith-number/DK72BGAA3LX4WFKBEY2MX2FVX5/graph.json","fetch_events":"https://pith.science/api/pith-number/DK72BGAA3LX4WFKBEY2MX2FVX5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DK72BGAA3LX4WFKBEY2MX2FVX5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DK72BGAA3LX4WFKBEY2MX2FVX5/action/storage_attestation","attest_author":"https://pith.science/pith/DK72BGAA3LX4WFKBEY2MX2FVX5/action/author_attestation","sign_citation":"https://pith.science/pith/DK72BGAA3LX4WFKBEY2MX2FVX5/action/citation_signature","submit_replication":"https://pith.science/pith/DK72BGAA3LX4WFKBEY2MX2FVX5/action/replication_record"}},"created_at":"2026-07-05T09:38:45.131915+00:00","updated_at":"2026-07-05T09:38:45.131915+00:00"}