{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ODHSQ6IMB5PO63AUZSFNK2NGNP","short_pith_number":"pith:ODHSQ6IM","canonical_record":{"source":{"id":"1305.3977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-17T04:31:24Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"74d01c33b9971037d477159d4cdc03696198d6c91f9c567ef9bbba3ab7b2a5e0","abstract_canon_sha256":"6f6b1f7790e86364d561b19d67d561c32bb7f449ee90e04fcbe324c9511e1ad2"},"schema_version":"1.0"},"canonical_sha256":"70cf28790c0f5eef6c14cc8ad569a66bc82946d49ef9453293dd2cb1378fb9c6","source":{"kind":"arxiv","id":"1305.3977","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3977","created_at":"2026-05-18T01:23:45Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3977v1","created_at":"2026-05-18T01:23:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3977","created_at":"2026-05-18T01:23:45Z"},{"alias_kind":"pith_short_12","alias_value":"ODHSQ6IMB5PO","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"ODHSQ6IMB5PO63AU","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"ODHSQ6IM","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ODHSQ6IMB5PO63AUZSFNK2NGNP","target":"record","payload":{"canonical_record":{"source":{"id":"1305.3977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-17T04:31:24Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"74d01c33b9971037d477159d4cdc03696198d6c91f9c567ef9bbba3ab7b2a5e0","abstract_canon_sha256":"6f6b1f7790e86364d561b19d67d561c32bb7f449ee90e04fcbe324c9511e1ad2"},"schema_version":"1.0"},"canonical_sha256":"70cf28790c0f5eef6c14cc8ad569a66bc82946d49ef9453293dd2cb1378fb9c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:45.629006Z","signature_b64":"exJbeVVfjyxEai6m5bo/DJeGIlxfokYe7it6Ia/QjtMKnTE7fHzHRk9ecBgVXrGPNtrwSPEG9mQMSLrnTE8oDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70cf28790c0f5eef6c14cc8ad569a66bc82946d49ef9453293dd2cb1378fb9c6","last_reissued_at":"2026-05-18T01:23:45.628301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:45.628301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.3977","source_version":1,"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:23:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/+1+5g5aBEFnbhsuz2fabWptN+dVECNaC+DhSXF68HK3dikI5NXMCMvJ56ksFLsuGCScgtH+YndbQioiKTRDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:57:37.760547Z"},"content_sha256":"c19527545512e5515c0ecc8265bc177b0033358577edb442789f9b5527ab2210","schema_version":"1.0","event_id":"sha256:c19527545512e5515c0ecc8265bc177b0033358577edb442789f9b5527ab2210"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ODHSQ6IMB5PO63AUZSFNK2NGNP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Invariant Gaussian processes and independent sets on regular graphs of large girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Bal\\'azs Gerencs\\'er, B\\'alint Vir\\'ag, Endre Cs\\'oka, Viktor Harangi","submitted_at":"2013-05-17T04:31:24Z","abstract_excerpt":"We prove that every 3-regular, n-vertex simple graph with sufficiently large girth contains an independent set of size at least 0.4361n. (The best known bound is 0.4352n.) In fact, computer simulation suggests that the bound our method provides is about 0.438n.\n  Our method uses invariant Gaussian processes on the d-regular tree that satisfy the eigenvector equation at each vertex for a certain eigenvalue \\lambda. We show that such processes can be approximated by i.i.d. factors provided that $|\\lambda| \\leq 2\\sqrt{d-1}$. We then use these approximations for $\\lambda = -2\\sqrt{d-1}$ to produce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3977","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"},"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:23:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wspjlst+nv27LPUJHfIiDJxUFLys12uioktz30NxiXgbI1XTzo7wau1nXCESJfN/uaB+rZhoorckMAf2HWZNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:57:37.761017Z"},"content_sha256":"2aa86c8b387e63cd8eb711465b826edfca503ab3995a6a67d0e3b85ea0f66437","schema_version":"1.0","event_id":"sha256:2aa86c8b387e63cd8eb711465b826edfca503ab3995a6a67d0e3b85ea0f66437"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ODHSQ6IMB5PO63AUZSFNK2NGNP/bundle.json","state_url":"https://pith.science/pith/ODHSQ6IMB5PO63AUZSFNK2NGNP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ODHSQ6IMB5PO63AUZSFNK2NGNP/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-05-31T12:57:37Z","links":{"resolver":"https://pith.science/pith/ODHSQ6IMB5PO63AUZSFNK2NGNP","bundle":"https://pith.science/pith/ODHSQ6IMB5PO63AUZSFNK2NGNP/bundle.json","state":"https://pith.science/pith/ODHSQ6IMB5PO63AUZSFNK2NGNP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ODHSQ6IMB5PO63AUZSFNK2NGNP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ODHSQ6IMB5PO63AUZSFNK2NGNP","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":"6f6b1f7790e86364d561b19d67d561c32bb7f449ee90e04fcbe324c9511e1ad2","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-17T04:31:24Z","title_canon_sha256":"74d01c33b9971037d477159d4cdc03696198d6c91f9c567ef9bbba3ab7b2a5e0"},"schema_version":"1.0","source":{"id":"1305.3977","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3977","created_at":"2026-05-18T01:23:45Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3977v1","created_at":"2026-05-18T01:23:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3977","created_at":"2026-05-18T01:23:45Z"},{"alias_kind":"pith_short_12","alias_value":"ODHSQ6IMB5PO","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"ODHSQ6IMB5PO63AU","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"ODHSQ6IM","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:2aa86c8b387e63cd8eb711465b826edfca503ab3995a6a67d0e3b85ea0f66437","target":"graph","created_at":"2026-05-18T01:23:45Z","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":"We prove that every 3-regular, n-vertex simple graph with sufficiently large girth contains an independent set of size at least 0.4361n. (The best known bound is 0.4352n.) In fact, computer simulation suggests that the bound our method provides is about 0.438n.\n  Our method uses invariant Gaussian processes on the d-regular tree that satisfy the eigenvector equation at each vertex for a certain eigenvalue \\lambda. We show that such processes can be approximated by i.i.d. factors provided that $|\\lambda| \\leq 2\\sqrt{d-1}$. We then use these approximations for $\\lambda = -2\\sqrt{d-1}$ to produce","authors_text":"Bal\\'azs Gerencs\\'er, B\\'alint Vir\\'ag, Endre Cs\\'oka, Viktor Harangi","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-17T04:31:24Z","title":"Invariant Gaussian processes and independent sets on regular graphs of large girth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3977","kind":"arxiv","version":1},"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:c19527545512e5515c0ecc8265bc177b0033358577edb442789f9b5527ab2210","target":"record","created_at":"2026-05-18T01:23:45Z","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":"6f6b1f7790e86364d561b19d67d561c32bb7f449ee90e04fcbe324c9511e1ad2","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-17T04:31:24Z","title_canon_sha256":"74d01c33b9971037d477159d4cdc03696198d6c91f9c567ef9bbba3ab7b2a5e0"},"schema_version":"1.0","source":{"id":"1305.3977","kind":"arxiv","version":1}},"canonical_sha256":"70cf28790c0f5eef6c14cc8ad569a66bc82946d49ef9453293dd2cb1378fb9c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70cf28790c0f5eef6c14cc8ad569a66bc82946d49ef9453293dd2cb1378fb9c6","first_computed_at":"2026-05-18T01:23:45.628301Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:45.628301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"exJbeVVfjyxEai6m5bo/DJeGIlxfokYe7it6Ia/QjtMKnTE7fHzHRk9ecBgVXrGPNtrwSPEG9mQMSLrnTE8oDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:45.629006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.3977","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c19527545512e5515c0ecc8265bc177b0033358577edb442789f9b5527ab2210","sha256:2aa86c8b387e63cd8eb711465b826edfca503ab3995a6a67d0e3b85ea0f66437"],"state_sha256":"7565692db4a21b946b3c1b4e1c4c6945188e58241ea19d8a9a156fbdc57499f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J7/VpPzIhnGwL+SlUomZVJCp3kix+PjO8eE0ADKFDpQjZ7+pNgMTNzAn/5OUu/yuA5zrjDgT6vWkqzxcsKQ8CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:57:37.764030Z","bundle_sha256":"f57b25f3765f745408a744131517342825284c128bef6d79c4e0853e0de38578"}}