{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ENYU6CZMV4XK4JFGJJMBBTO3KJ","short_pith_number":"pith:ENYU6CZM","canonical_record":{"source":{"id":"2504.02806","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-03T17:51:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"72bf6f85c07dbfb92679200557bd5ed46c35d80b65f417c6bb79f8edb416ec1f","abstract_canon_sha256":"72109c4ddea2ffb7823cd76d3443c6473d32b49774134285588c91e06ee516f1"},"schema_version":"1.0"},"canonical_sha256":"23714f0b2caf2eae24a64a5810cddb524d9a09a10b837e0f054c33b8ed51a413","source":{"kind":"arxiv","id":"2504.02806","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.02806","created_at":"2026-07-05T11:02:22Z"},{"alias_kind":"arxiv_version","alias_value":"2504.02806v3","created_at":"2026-07-05T11:02:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.02806","created_at":"2026-07-05T11:02:22Z"},{"alias_kind":"pith_short_12","alias_value":"ENYU6CZMV4XK","created_at":"2026-07-05T11:02:22Z"},{"alias_kind":"pith_short_16","alias_value":"ENYU6CZMV4XK4JFG","created_at":"2026-07-05T11:02:22Z"},{"alias_kind":"pith_short_8","alias_value":"ENYU6CZM","created_at":"2026-07-05T11:02:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ENYU6CZMV4XK4JFGJJMBBTO3KJ","target":"record","payload":{"canonical_record":{"source":{"id":"2504.02806","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-03T17:51:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"72bf6f85c07dbfb92679200557bd5ed46c35d80b65f417c6bb79f8edb416ec1f","abstract_canon_sha256":"72109c4ddea2ffb7823cd76d3443c6473d32b49774134285588c91e06ee516f1"},"schema_version":"1.0"},"canonical_sha256":"23714f0b2caf2eae24a64a5810cddb524d9a09a10b837e0f054c33b8ed51a413","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:02:22.741560Z","signature_b64":"BdbxN3V6CpxA8v7JLJUQcUCAkDGfiqNLb54kzBdA+419m58+j4kXxd6DM+9bXguJ8jweR3v71OrQS8bI1XFcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23714f0b2caf2eae24a64a5810cddb524d9a09a10b837e0f054c33b8ed51a413","last_reissued_at":"2026-07-05T11:02:22.741046Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:02:22.741046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.02806","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-05T11:02:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wM8Ddhb8//Oji34rbTXto1Us7Lnfcr6zW6ytwNEqnVN0xmPmJM9wgLdnWeE6EQwBkwSgN4RXTmZ1y2aVcTPpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T06:48:39.654773Z"},"content_sha256":"83a73580f28c5f714370901a6b82852a0b3d62d31e1cc24911733197e849b456","schema_version":"1.0","event_id":"sha256:83a73580f28c5f714370901a6b82852a0b3d62d31e1cc24911733197e849b456"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ENYU6CZMV4XK4JFGJJMBBTO3KJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vertex-Based Localization of Tur\\'{a}n's Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bangalore), L. Sunil Chandran (Indian Institute of Science, Rajat Adak","submitted_at":"2025-04-03T17:51:50Z","abstract_excerpt":"Let $G$ be a simple graph with $n$ vertices and $m$ edges. According to Tur\\'{a}n's theorem, if $G$ is $K_{r+1}$-free, then $m \\leq |E(T(n, r))|,$ where $T(n, r)$ denotes the Tur\\'{a}n graph on $n$ vertices with a maximum clique of order $r$. A limitation of this statement is that it does not give an expression in terms of $n$ and $r$. A widely used version of Tur\\'{a}n's theorem states that for an $n$-vertex $K_{r+1}$-free graph, $m \\leq \\left\\lfloor \\frac{n^2(r-1)}{2r} \\right\\rfloor.$ Though this bound is often more convenient, it is not the same as the original statement. In particular, the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.02806","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/2504.02806/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-05T11:02:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J1xIyuT7Zn870iL5nNINBq/urs3+hytA5xTkb9qA08ZyYsucpiyYQ+skYC3h4Ji4VPk6pYMWQnRMDX4RJs9uCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T06:48:39.655335Z"},"content_sha256":"b7cb2ccbe897d597b3c844e0c724b1f96a4cc0923ea6f26cac43858280f06e99","schema_version":"1.0","event_id":"sha256:b7cb2ccbe897d597b3c844e0c724b1f96a4cc0923ea6f26cac43858280f06e99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ENYU6CZMV4XK4JFGJJMBBTO3KJ/bundle.json","state_url":"https://pith.science/pith/ENYU6CZMV4XK4JFGJJMBBTO3KJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ENYU6CZMV4XK4JFGJJMBBTO3KJ/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-06T06:48:39Z","links":{"resolver":"https://pith.science/pith/ENYU6CZMV4XK4JFGJJMBBTO3KJ","bundle":"https://pith.science/pith/ENYU6CZMV4XK4JFGJJMBBTO3KJ/bundle.json","state":"https://pith.science/pith/ENYU6CZMV4XK4JFGJJMBBTO3KJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ENYU6CZMV4XK4JFGJJMBBTO3KJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ENYU6CZMV4XK4JFGJJMBBTO3KJ","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":"72109c4ddea2ffb7823cd76d3443c6473d32b49774134285588c91e06ee516f1","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-03T17:51:50Z","title_canon_sha256":"72bf6f85c07dbfb92679200557bd5ed46c35d80b65f417c6bb79f8edb416ec1f"},"schema_version":"1.0","source":{"id":"2504.02806","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.02806","created_at":"2026-07-05T11:02:22Z"},{"alias_kind":"arxiv_version","alias_value":"2504.02806v3","created_at":"2026-07-05T11:02:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.02806","created_at":"2026-07-05T11:02:22Z"},{"alias_kind":"pith_short_12","alias_value":"ENYU6CZMV4XK","created_at":"2026-07-05T11:02:22Z"},{"alias_kind":"pith_short_16","alias_value":"ENYU6CZMV4XK4JFG","created_at":"2026-07-05T11:02:22Z"},{"alias_kind":"pith_short_8","alias_value":"ENYU6CZM","created_at":"2026-07-05T11:02:22Z"}],"graph_snapshots":[{"event_id":"sha256:b7cb2ccbe897d597b3c844e0c724b1f96a4cc0923ea6f26cac43858280f06e99","target":"graph","created_at":"2026-07-05T11:02:22Z","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/2504.02806/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a simple graph with $n$ vertices and $m$ edges. According to Tur\\'{a}n's theorem, if $G$ is $K_{r+1}$-free, then $m \\leq |E(T(n, r))|,$ where $T(n, r)$ denotes the Tur\\'{a}n graph on $n$ vertices with a maximum clique of order $r$. A limitation of this statement is that it does not give an expression in terms of $n$ and $r$. A widely used version of Tur\\'{a}n's theorem states that for an $n$-vertex $K_{r+1}$-free graph, $m \\leq \\left\\lfloor \\frac{n^2(r-1)}{2r} \\right\\rfloor.$ Though this bound is often more convenient, it is not the same as the original statement. In particular, the","authors_text":"Bangalore), L. Sunil Chandran (Indian Institute of Science, Rajat Adak","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-03T17:51:50Z","title":"Vertex-Based Localization of Tur\\'{a}n's Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.02806","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:83a73580f28c5f714370901a6b82852a0b3d62d31e1cc24911733197e849b456","target":"record","created_at":"2026-07-05T11:02:22Z","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":"72109c4ddea2ffb7823cd76d3443c6473d32b49774134285588c91e06ee516f1","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-03T17:51:50Z","title_canon_sha256":"72bf6f85c07dbfb92679200557bd5ed46c35d80b65f417c6bb79f8edb416ec1f"},"schema_version":"1.0","source":{"id":"2504.02806","kind":"arxiv","version":3}},"canonical_sha256":"23714f0b2caf2eae24a64a5810cddb524d9a09a10b837e0f054c33b8ed51a413","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23714f0b2caf2eae24a64a5810cddb524d9a09a10b837e0f054c33b8ed51a413","first_computed_at":"2026-07-05T11:02:22.741046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:02:22.741046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BdbxN3V6CpxA8v7JLJUQcUCAkDGfiqNLb54kzBdA+419m58+j4kXxd6DM+9bXguJ8jweR3v71OrQS8bI1XFcBg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:02:22.741560Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.02806","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83a73580f28c5f714370901a6b82852a0b3d62d31e1cc24911733197e849b456","sha256:b7cb2ccbe897d597b3c844e0c724b1f96a4cc0923ea6f26cac43858280f06e99"],"state_sha256":"f1ec0efdbbdad2dc1918259aea3120dbec24c0fa9df02937690ffa6ef6484450"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iCyRHpXSRVbOk57m/qFYTOKtqXohA6pLAgICVssHckYGTlbNUI1eeuyxaAqSeCy9k81pDqgBpCQiLVtObxvDAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T06:48:39.659344Z","bundle_sha256":"ea2929a5e94843dae903c9adfb89b0b83be1a41b35066de517142a3f2af861fd"}}