{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ATCXCA6NVOWN76PKUMKOHMKWM5","short_pith_number":"pith:ATCXCA6N","canonical_record":{"source":{"id":"1708.02317","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-07T21:59:04Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"b25a6ce2e7903515d99cf453c5dd4b582a583e6ed29f9e822b2955f80f7645e0","abstract_canon_sha256":"ee20c599e9616abd90402fecb214b73bf23d72b3a42a479ddbbcd48239bffe69"},"schema_version":"1.0"},"canonical_sha256":"04c57103cdabacdff9eaa314e3b15667620a0218b578ebef4f28b5d6c62cff91","source":{"kind":"arxiv","id":"1708.02317","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02317","created_at":"2026-07-05T01:07:09Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02317v3","created_at":"2026-07-05T01:07:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02317","created_at":"2026-07-05T01:07:09Z"},{"alias_kind":"pith_short_12","alias_value":"ATCXCA6NVOWN","created_at":"2026-07-05T01:07:09Z"},{"alias_kind":"pith_short_16","alias_value":"ATCXCA6NVOWN76PK","created_at":"2026-07-05T01:07:09Z"},{"alias_kind":"pith_short_8","alias_value":"ATCXCA6N","created_at":"2026-07-05T01:07:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ATCXCA6NVOWN76PKUMKOHMKWM5","target":"record","payload":{"canonical_record":{"source":{"id":"1708.02317","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-07T21:59:04Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"b25a6ce2e7903515d99cf453c5dd4b582a583e6ed29f9e822b2955f80f7645e0","abstract_canon_sha256":"ee20c599e9616abd90402fecb214b73bf23d72b3a42a479ddbbcd48239bffe69"},"schema_version":"1.0"},"canonical_sha256":"04c57103cdabacdff9eaa314e3b15667620a0218b578ebef4f28b5d6c62cff91","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:07:09.718661Z","signature_b64":"7d/xMkuJw8ZtpF9/fuJ8ZrX/60qnnYT1/0Gqe4QpVP47EH2gBqDP8iVwyiUwWFqa3giJ20c0bhApZVw5zHJVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04c57103cdabacdff9eaa314e3b15667620a0218b578ebef4f28b5d6c62cff91","last_reissued_at":"2026-07-05T01:07:09.718134Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:07:09.718134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.02317","source_version":3,"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-07-05T01:07:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4m9Z+8udgt3GOAww61DNy+EkDxKfpTeDUoGGZBRdCBFO0gHPB3kiwL63dFdd2IVMAejT45fV9HeaVw7peqpLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T08:39:51.682894Z"},"content_sha256":"a25317118f50b3b85f417fa9c22e5cc14b1f46b259723ccc8364978430f751a1","schema_version":"1.0","event_id":"sha256:a25317118f50b3b85f417fa9c22e5cc14b1f46b259723ccc8364978430f751a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ATCXCA6NVOWN76PKUMKOHMKWM5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Forbidden subgraphs for graphs of bounded spectral radius, with applications to equiangular lines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Alexandr Polyanskii, Zilin Jiang","submitted_at":"2017-08-07T21:59:04Z","abstract_excerpt":"The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Let $\\mathcal{F}(\\lambda)$ be the family of connected graphs of spectral radius $\\le \\lambda$. We show that $\\mathcal{F}(\\lambda)$ can be defined by a finite set of forbidden subgraphs if and only if $\\lambda < \\lambda^* := \\sqrt{2+\\sqrt{5}} \\approx 2.058$ and $\\lambda \\not\\in \\{\\alpha_2, \\alpha_3, \\dots\\}$, where $\\alpha_m = \\beta_m^{1/2} + \\beta_m^{-1/2}$ and $\\beta_m$ is the largest root of $x^{m+1}=1+x+\\dots+x^{m-1}$. The study of forbidden subgraphs characterization for $\\mathcal{F}(\\lambda)$ is motivated by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02317","kind":"arxiv","version":3},"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/1708.02317/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"},"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-07-05T01:07:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MsyHms5ksS8vKCEFrT9udWzclh7ErSx5ntRuhvfZ7k5IFfrhDZVl5a+yEZv+vRV2k+2SFvB1yeQOZMHbhkDfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T08:39:51.683404Z"},"content_sha256":"eec4b60d7dd929c2eab605b096e38c98a50b2dfdd69d7979216d813fef543ed3","schema_version":"1.0","event_id":"sha256:eec4b60d7dd929c2eab605b096e38c98a50b2dfdd69d7979216d813fef543ed3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ATCXCA6NVOWN76PKUMKOHMKWM5/bundle.json","state_url":"https://pith.science/pith/ATCXCA6NVOWN76PKUMKOHMKWM5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ATCXCA6NVOWN76PKUMKOHMKWM5/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-08-23T08:39:51Z","links":{"resolver":"https://pith.science/pith/ATCXCA6NVOWN76PKUMKOHMKWM5","bundle":"https://pith.science/pith/ATCXCA6NVOWN76PKUMKOHMKWM5/bundle.json","state":"https://pith.science/pith/ATCXCA6NVOWN76PKUMKOHMKWM5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ATCXCA6NVOWN76PKUMKOHMKWM5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ATCXCA6NVOWN76PKUMKOHMKWM5","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":"ee20c599e9616abd90402fecb214b73bf23d72b3a42a479ddbbcd48239bffe69","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-07T21:59:04Z","title_canon_sha256":"b25a6ce2e7903515d99cf453c5dd4b582a583e6ed29f9e822b2955f80f7645e0"},"schema_version":"1.0","source":{"id":"1708.02317","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02317","created_at":"2026-07-05T01:07:09Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02317v3","created_at":"2026-07-05T01:07:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02317","created_at":"2026-07-05T01:07:09Z"},{"alias_kind":"pith_short_12","alias_value":"ATCXCA6NVOWN","created_at":"2026-07-05T01:07:09Z"},{"alias_kind":"pith_short_16","alias_value":"ATCXCA6NVOWN76PK","created_at":"2026-07-05T01:07:09Z"},{"alias_kind":"pith_short_8","alias_value":"ATCXCA6N","created_at":"2026-07-05T01:07:09Z"}],"graph_snapshots":[{"event_id":"sha256:eec4b60d7dd929c2eab605b096e38c98a50b2dfdd69d7979216d813fef543ed3","target":"graph","created_at":"2026-07-05T01:07:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1708.02317/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Let $\\mathcal{F}(\\lambda)$ be the family of connected graphs of spectral radius $\\le \\lambda$. We show that $\\mathcal{F}(\\lambda)$ can be defined by a finite set of forbidden subgraphs if and only if $\\lambda < \\lambda^* := \\sqrt{2+\\sqrt{5}} \\approx 2.058$ and $\\lambda \\not\\in \\{\\alpha_2, \\alpha_3, \\dots\\}$, where $\\alpha_m = \\beta_m^{1/2} + \\beta_m^{-1/2}$ and $\\beta_m$ is the largest root of $x^{m+1}=1+x+\\dots+x^{m-1}$. The study of forbidden subgraphs characterization for $\\mathcal{F}(\\lambda)$ is motivated by","authors_text":"Alexandr Polyanskii, Zilin Jiang","cross_cats":["math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-07T21:59:04Z","title":"Forbidden subgraphs for graphs of bounded spectral radius, with applications to equiangular lines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02317","kind":"arxiv","version":3},"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:a25317118f50b3b85f417fa9c22e5cc14b1f46b259723ccc8364978430f751a1","target":"record","created_at":"2026-07-05T01:07:09Z","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":"ee20c599e9616abd90402fecb214b73bf23d72b3a42a479ddbbcd48239bffe69","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-07T21:59:04Z","title_canon_sha256":"b25a6ce2e7903515d99cf453c5dd4b582a583e6ed29f9e822b2955f80f7645e0"},"schema_version":"1.0","source":{"id":"1708.02317","kind":"arxiv","version":3}},"canonical_sha256":"04c57103cdabacdff9eaa314e3b15667620a0218b578ebef4f28b5d6c62cff91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04c57103cdabacdff9eaa314e3b15667620a0218b578ebef4f28b5d6c62cff91","first_computed_at":"2026-07-05T01:07:09.718134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:07:09.718134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7d/xMkuJw8ZtpF9/fuJ8ZrX/60qnnYT1/0Gqe4QpVP47EH2gBqDP8iVwyiUwWFqa3giJ20c0bhApZVw5zHJVAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:07:09.718661Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02317","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a25317118f50b3b85f417fa9c22e5cc14b1f46b259723ccc8364978430f751a1","sha256:eec4b60d7dd929c2eab605b096e38c98a50b2dfdd69d7979216d813fef543ed3"],"state_sha256":"c1333f39b9f445861f2d8f9c794db1f9a0d22ee889a8ee05c8f03b8a6509cb00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"swheG2S80H+EdlV8P1CN+nNDJb8qkTVtLonlzjRARxnrd24C1ku4n2s46fphnM67ZcNAVUh+1/HHBNBM1yACBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T08:39:51.688089Z","bundle_sha256":"8e11f4ad8b4b70ad00f2f8990d5e38f8773d88edeb586c98198fcf021b9dc9f6"}}