{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:VACEBCXDAL3YJDBNHB434AG6UI","short_pith_number":"pith:VACEBCXD","schema_version":"1.0","canonical_sha256":"a804408ae302f7848c2d3879be00dea20d153c227d23f8f1a12520123989b736","source":{"kind":"arxiv","id":"math/0612377","version":1},"attestation_state":"computed","paper":{"title":"Fourier analysis and large independent sets in powers of complete graphs","license":"","headline":"","cross_cats":["math.FA"],"primary_cat":"math.CO","authors_text":"Hamed Hatami, Mahya Ghandehari","submitted_at":"2006-12-14T00:44:22Z","abstract_excerpt":"For constant $r$ and arbitrary $n$, it was known that in the graph $K_r^n$ any independent set of size close to the maximum is close to some independent set of maximum size. We prove that this statement holds for arbitrary $r$ and $n$."},"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":"math/0612377","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2006-12-14T00:44:22Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"4875dfa7101a6baeec2533280b3e582b613d1a24b209db678e5c0aeda54b5aa8","abstract_canon_sha256":"ee870771891398910dfbe9892355fdc4bf0aefcaf5bfc369b810865e916bf5b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:50:51.625253Z","signature_b64":"cJ+LhWrD2cFzStTD4ERevmqMNxAYnMI121HqOBr2UJrtD/ry5RgNEoz7UXonTaI4IZLsnUT4kFxs3v7qp50gDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a804408ae302f7848c2d3879be00dea20d153c227d23f8f1a12520123989b736","last_reissued_at":"2026-07-04T14:50:51.624818Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:50:51.624818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fourier analysis and large independent sets in powers of complete graphs","license":"","headline":"","cross_cats":["math.FA"],"primary_cat":"math.CO","authors_text":"Hamed Hatami, Mahya Ghandehari","submitted_at":"2006-12-14T00:44:22Z","abstract_excerpt":"For constant $r$ and arbitrary $n$, it was known that in the graph $K_r^n$ any independent set of size close to the maximum is close to some independent set of maximum size. We prove that this statement holds for arbitrary $r$ and $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0612377","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/math/0612377/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":"math/0612377","created_at":"2026-07-04T14:50:51.624890+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0612377v1","created_at":"2026-07-04T14:50:51.624890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0612377","created_at":"2026-07-04T14:50:51.624890+00:00"},{"alias_kind":"pith_short_12","alias_value":"VACEBCXDAL3Y","created_at":"2026-07-04T14:50:51.624890+00:00"},{"alias_kind":"pith_short_16","alias_value":"VACEBCXDAL3YJDBN","created_at":"2026-07-04T14:50:51.624890+00:00"},{"alias_kind":"pith_short_8","alias_value":"VACEBCXD","created_at":"2026-07-04T14:50:51.624890+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/VACEBCXDAL3YJDBNHB434AG6UI","json":"https://pith.science/pith/VACEBCXDAL3YJDBNHB434AG6UI.json","graph_json":"https://pith.science/api/pith-number/VACEBCXDAL3YJDBNHB434AG6UI/graph.json","events_json":"https://pith.science/api/pith-number/VACEBCXDAL3YJDBNHB434AG6UI/events.json","paper":"https://pith.science/paper/VACEBCXD"},"agent_actions":{"view_html":"https://pith.science/pith/VACEBCXDAL3YJDBNHB434AG6UI","download_json":"https://pith.science/pith/VACEBCXDAL3YJDBNHB434AG6UI.json","view_paper":"https://pith.science/paper/VACEBCXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0612377&json=true","fetch_graph":"https://pith.science/api/pith-number/VACEBCXDAL3YJDBNHB434AG6UI/graph.json","fetch_events":"https://pith.science/api/pith-number/VACEBCXDAL3YJDBNHB434AG6UI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VACEBCXDAL3YJDBNHB434AG6UI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VACEBCXDAL3YJDBNHB434AG6UI/action/storage_attestation","attest_author":"https://pith.science/pith/VACEBCXDAL3YJDBNHB434AG6UI/action/author_attestation","sign_citation":"https://pith.science/pith/VACEBCXDAL3YJDBNHB434AG6UI/action/citation_signature","submit_replication":"https://pith.science/pith/VACEBCXDAL3YJDBNHB434AG6UI/action/replication_record"}},"created_at":"2026-07-04T14:50:51.624890+00:00","updated_at":"2026-07-04T14:50:51.624890+00:00"}