{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:K4XT4RDZKNIM23D7IN3U5BLNY4","short_pith_number":"pith:K4XT4RDZ","canonical_record":{"source":{"id":"1308.5173","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-08-23T16:27:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1f737a2da8d3dd2fc82afd0b928b6539caacf75a17b2a0f2708dc0136a98e64e","abstract_canon_sha256":"6098e70421fb386fb38c94b995ced32826607c435cda55d4e69bcd45d78f84c1"},"schema_version":"1.0"},"canonical_sha256":"572f3e44795350cd6c7f43774e856dc706022b35f77c82a837cacae6ad6f6df6","source":{"kind":"arxiv","id":"1308.5173","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5173","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5173v2","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5173","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"pith_short_12","alias_value":"K4XT4RDZKNIM","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"K4XT4RDZKNIM23D7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"K4XT4RDZ","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:K4XT4RDZKNIM23D7IN3U5BLNY4","target":"record","payload":{"canonical_record":{"source":{"id":"1308.5173","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-08-23T16:27:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1f737a2da8d3dd2fc82afd0b928b6539caacf75a17b2a0f2708dc0136a98e64e","abstract_canon_sha256":"6098e70421fb386fb38c94b995ced32826607c435cda55d4e69bcd45d78f84c1"},"schema_version":"1.0"},"canonical_sha256":"572f3e44795350cd6c7f43774e856dc706022b35f77c82a837cacae6ad6f6df6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:32.576943Z","signature_b64":"bSceAQOS60wlMKt9lyzaEhZwXezqzej0SZndaSC7WoDjCkgHYFd+9SNtivvYwHUJparCTu/jnuAI+gHMalFoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"572f3e44795350cd6c7f43774e856dc706022b35f77c82a837cacae6ad6f6df6","last_reissued_at":"2026-05-18T01:09:32.576530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:32.576530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.5173","source_version":2,"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-05-18T01:09:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AIaGWYJsHLFXPwO1BLmuz/jF38CuYumLg4SS1+j6/TRnEiY/YXILgWXaVQzhuF3bGSCvoLGlqJ9/YZdqF4AiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T19:21:43.256173Z"},"content_sha256":"fb3cc3fdd3e2cc91061942513ab089dd217bec0d55f0524dbd0c6b78e3e967ae","schema_version":"1.0","event_id":"sha256:fb3cc3fdd3e2cc91061942513ab089dd217bec0d55f0524dbd0c6b78e3e967ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:K4XT4RDZKNIM23D7IN3U5BLNY4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Independence ratio and random eigenvectors in transitive graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"B\\'alint Vir\\'ag, Viktor Harangi","submitted_at":"2013-08-23T16:27:12Z","abstract_excerpt":"A theorem of Hoffman gives an upper bound on the independence ratio of regular graphs in terms of the minimum $\\lambda_{\\min}$ of the spectrum of the adjacency matrix. To complement this result we use random eigenvectors to gain lower bounds in the vertex-transitive case. For example, we prove that the independence ratio of a $3$-regular transitive graph is at least \\[q=\\frac{1}{2}-\\frac{3}{4\\pi}\\arccos\\biggl(\\frac{1-\\lambda _{\\min}}{4}\\biggr).\\] The same bound holds for infinite transitive graphs: we construct factor of i.i.d. independent sets for which the probability that any given vertex i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5173","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"},"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-05-18T01:09:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bWuEBQARMXzzGb8qnVqVEPoPkEPf469th5cGSUFIaGJ7w03e9npsdBBppJhc+HLcNX2XkpUYakgm0bZx+8v8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T19:21:43.256544Z"},"content_sha256":"8cec86465817658b3f407c0f7f39016b8b02844589f9b438f6de32b70cb24cbb","schema_version":"1.0","event_id":"sha256:8cec86465817658b3f407c0f7f39016b8b02844589f9b438f6de32b70cb24cbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K4XT4RDZKNIM23D7IN3U5BLNY4/bundle.json","state_url":"https://pith.science/pith/K4XT4RDZKNIM23D7IN3U5BLNY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K4XT4RDZKNIM23D7IN3U5BLNY4/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-06-20T19:21:43Z","links":{"resolver":"https://pith.science/pith/K4XT4RDZKNIM23D7IN3U5BLNY4","bundle":"https://pith.science/pith/K4XT4RDZKNIM23D7IN3U5BLNY4/bundle.json","state":"https://pith.science/pith/K4XT4RDZKNIM23D7IN3U5BLNY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K4XT4RDZKNIM23D7IN3U5BLNY4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:K4XT4RDZKNIM23D7IN3U5BLNY4","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":"6098e70421fb386fb38c94b995ced32826607c435cda55d4e69bcd45d78f84c1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-08-23T16:27:12Z","title_canon_sha256":"1f737a2da8d3dd2fc82afd0b928b6539caacf75a17b2a0f2708dc0136a98e64e"},"schema_version":"1.0","source":{"id":"1308.5173","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5173","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5173v2","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5173","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"pith_short_12","alias_value":"K4XT4RDZKNIM","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"K4XT4RDZKNIM23D7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"K4XT4RDZ","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:8cec86465817658b3f407c0f7f39016b8b02844589f9b438f6de32b70cb24cbb","target":"graph","created_at":"2026-05-18T01:09:32Z","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"},"paper":{"abstract_excerpt":"A theorem of Hoffman gives an upper bound on the independence ratio of regular graphs in terms of the minimum $\\lambda_{\\min}$ of the spectrum of the adjacency matrix. To complement this result we use random eigenvectors to gain lower bounds in the vertex-transitive case. For example, we prove that the independence ratio of a $3$-regular transitive graph is at least \\[q=\\frac{1}{2}-\\frac{3}{4\\pi}\\arccos\\biggl(\\frac{1-\\lambda _{\\min}}{4}\\biggr).\\] The same bound holds for infinite transitive graphs: we construct factor of i.i.d. independent sets for which the probability that any given vertex i","authors_text":"B\\'alint Vir\\'ag, Viktor Harangi","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-08-23T16:27:12Z","title":"Independence ratio and random eigenvectors in transitive graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5173","kind":"arxiv","version":2},"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:fb3cc3fdd3e2cc91061942513ab089dd217bec0d55f0524dbd0c6b78e3e967ae","target":"record","created_at":"2026-05-18T01:09:32Z","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":"6098e70421fb386fb38c94b995ced32826607c435cda55d4e69bcd45d78f84c1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-08-23T16:27:12Z","title_canon_sha256":"1f737a2da8d3dd2fc82afd0b928b6539caacf75a17b2a0f2708dc0136a98e64e"},"schema_version":"1.0","source":{"id":"1308.5173","kind":"arxiv","version":2}},"canonical_sha256":"572f3e44795350cd6c7f43774e856dc706022b35f77c82a837cacae6ad6f6df6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"572f3e44795350cd6c7f43774e856dc706022b35f77c82a837cacae6ad6f6df6","first_computed_at":"2026-05-18T01:09:32.576530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:32.576530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bSceAQOS60wlMKt9lyzaEhZwXezqzej0SZndaSC7WoDjCkgHYFd+9SNtivvYwHUJparCTu/jnuAI+gHMalFoAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:32.576943Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.5173","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb3cc3fdd3e2cc91061942513ab089dd217bec0d55f0524dbd0c6b78e3e967ae","sha256:8cec86465817658b3f407c0f7f39016b8b02844589f9b438f6de32b70cb24cbb"],"state_sha256":"0b15de92e98595871e62dc5104e6b8841d564b255d0fb7d1eb3e6448689a9579"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9UpSGI83vHmJ6vCViCwsYLmWvGS2CjSYlDTa4dXRbD3qwf9lr7bxPnDcw1B/xXPzx12sBMyjKkTeJcVEVmzQBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T19:21:43.258442Z","bundle_sha256":"a6052f3a6dc77edcb3ae46d75e6491de1fdb125ca12829094fb7ab95a88cc2eb"}}