{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:WRQPDCABHBSBPHOQNCSB7TIVVK","short_pith_number":"pith:WRQPDCAB","canonical_record":{"source":{"id":"2504.01501","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-02T08:52:28Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"079d94712e00183ab0b1478b5bb3bf46df483a3b11df3f5e5a899159faaf438e","abstract_canon_sha256":"ce42bbd7209949ce44815d8a6371287fdf9a8f0fb41e54d79e1c024ec6d2d503"},"schema_version":"1.0"},"canonical_sha256":"b460f188013864179dd068a41fcd15aa98cb9a3c9abfaa019fa8cc046f00d5bb","source":{"kind":"arxiv","id":"2504.01501","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.01501","created_at":"2026-07-05T10:59:28Z"},{"alias_kind":"arxiv_version","alias_value":"2504.01501v2","created_at":"2026-07-05T10:59:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.01501","created_at":"2026-07-05T10:59:28Z"},{"alias_kind":"pith_short_12","alias_value":"WRQPDCABHBSB","created_at":"2026-07-05T10:59:28Z"},{"alias_kind":"pith_short_16","alias_value":"WRQPDCABHBSBPHOQ","created_at":"2026-07-05T10:59:28Z"},{"alias_kind":"pith_short_8","alias_value":"WRQPDCAB","created_at":"2026-07-05T10:59:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:WRQPDCABHBSBPHOQNCSB7TIVVK","target":"record","payload":{"canonical_record":{"source":{"id":"2504.01501","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-02T08:52:28Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"079d94712e00183ab0b1478b5bb3bf46df483a3b11df3f5e5a899159faaf438e","abstract_canon_sha256":"ce42bbd7209949ce44815d8a6371287fdf9a8f0fb41e54d79e1c024ec6d2d503"},"schema_version":"1.0"},"canonical_sha256":"b460f188013864179dd068a41fcd15aa98cb9a3c9abfaa019fa8cc046f00d5bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:28.521890Z","signature_b64":"bcLi9EFzuVT3kBPeGbprCeBm3xGJSQ3rnXJSRIuYeT2BxnMhN+546WjrGuly63beLbbDKedjuWkjZeqD8+DABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b460f188013864179dd068a41fcd15aa98cb9a3c9abfaa019fa8cc046f00d5bb","last_reissued_at":"2026-07-05T10:59:28.521396Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:28.521396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.01501","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-07-05T10:59:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mWeVoSJQqmCAERzdCg7bW4inyFruR7YXFvJznIB91rnhZz16mAaKDu0mQIr0rwHnjTXBDm7GwrWKj9jYD+XwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:48:03.353594Z"},"content_sha256":"4616f78bb747e2fbf072a39fa86f100555185b6d23ad0a1eaa649a30fac5b646","schema_version":"1.0","event_id":"sha256:4616f78bb747e2fbf072a39fa86f100555185b6d23ad0a1eaa649a30fac5b646"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:WRQPDCABHBSBPHOQNCSB7TIVVK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vertex-Based Localization of Erd\\H{o}s-Gallai Theorems for Paths and Cycles","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-02T08:52:28Z","abstract_excerpt":"For a simple graph $G$, let $n$ and $m$ denote the number of vertices and edges in $G$, respectively. The Erd\\H{o}s-Gallai theorem for paths states that in a simple $P_k$-free graph, $m \\leq \\frac{n(k-1)}{2}$, where $P_k$ denotes a path with length $k$ (that is, with $k$ edges). In this paper, we generalize this result as follows: For each $v \\in V(G)$, let $p(v)$ be the length of the longest path that contains $v$. We show that \\[m \\leq \\sum_{v \\in V(G)} \\frac{p(v)}{2}\\] The Erd\\H{o}s-Gallai theorem for cycles states that in a simple graph $G$ with circumference (that is, the length of the lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.01501","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.01501/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-05T10:59:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9UfSVepnw799fiDulv5wIuwsSeVFC2pF1mM9PmMnFLRepricQ1CTdjSDEvA7QyR83NNEECgKLH6gHKoq6KN8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:48:03.354057Z"},"content_sha256":"910b048525652c5b99ba2c47cca27a4712993886e7531665c6258eb8da5b1a0a","schema_version":"1.0","event_id":"sha256:910b048525652c5b99ba2c47cca27a4712993886e7531665c6258eb8da5b1a0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WRQPDCABHBSBPHOQNCSB7TIVVK/bundle.json","state_url":"https://pith.science/pith/WRQPDCABHBSBPHOQNCSB7TIVVK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WRQPDCABHBSBPHOQNCSB7TIVVK/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-06T22:48:03Z","links":{"resolver":"https://pith.science/pith/WRQPDCABHBSBPHOQNCSB7TIVVK","bundle":"https://pith.science/pith/WRQPDCABHBSBPHOQNCSB7TIVVK/bundle.json","state":"https://pith.science/pith/WRQPDCABHBSBPHOQNCSB7TIVVK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WRQPDCABHBSBPHOQNCSB7TIVVK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:WRQPDCABHBSBPHOQNCSB7TIVVK","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":"ce42bbd7209949ce44815d8a6371287fdf9a8f0fb41e54d79e1c024ec6d2d503","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-02T08:52:28Z","title_canon_sha256":"079d94712e00183ab0b1478b5bb3bf46df483a3b11df3f5e5a899159faaf438e"},"schema_version":"1.0","source":{"id":"2504.01501","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.01501","created_at":"2026-07-05T10:59:28Z"},{"alias_kind":"arxiv_version","alias_value":"2504.01501v2","created_at":"2026-07-05T10:59:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.01501","created_at":"2026-07-05T10:59:28Z"},{"alias_kind":"pith_short_12","alias_value":"WRQPDCABHBSB","created_at":"2026-07-05T10:59:28Z"},{"alias_kind":"pith_short_16","alias_value":"WRQPDCABHBSBPHOQ","created_at":"2026-07-05T10:59:28Z"},{"alias_kind":"pith_short_8","alias_value":"WRQPDCAB","created_at":"2026-07-05T10:59:28Z"}],"graph_snapshots":[{"event_id":"sha256:910b048525652c5b99ba2c47cca27a4712993886e7531665c6258eb8da5b1a0a","target":"graph","created_at":"2026-07-05T10:59:28Z","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.01501/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a simple graph $G$, let $n$ and $m$ denote the number of vertices and edges in $G$, respectively. The Erd\\H{o}s-Gallai theorem for paths states that in a simple $P_k$-free graph, $m \\leq \\frac{n(k-1)}{2}$, where $P_k$ denotes a path with length $k$ (that is, with $k$ edges). In this paper, we generalize this result as follows: For each $v \\in V(G)$, let $p(v)$ be the length of the longest path that contains $v$. We show that \\[m \\leq \\sum_{v \\in V(G)} \\frac{p(v)}{2}\\] The Erd\\H{o}s-Gallai theorem for cycles states that in a simple graph $G$ with circumference (that is, the length of the lo","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-02T08:52:28Z","title":"Vertex-Based Localization of Erd\\H{o}s-Gallai Theorems for Paths and Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.01501","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:4616f78bb747e2fbf072a39fa86f100555185b6d23ad0a1eaa649a30fac5b646","target":"record","created_at":"2026-07-05T10:59:28Z","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":"ce42bbd7209949ce44815d8a6371287fdf9a8f0fb41e54d79e1c024ec6d2d503","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-02T08:52:28Z","title_canon_sha256":"079d94712e00183ab0b1478b5bb3bf46df483a3b11df3f5e5a899159faaf438e"},"schema_version":"1.0","source":{"id":"2504.01501","kind":"arxiv","version":2}},"canonical_sha256":"b460f188013864179dd068a41fcd15aa98cb9a3c9abfaa019fa8cc046f00d5bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b460f188013864179dd068a41fcd15aa98cb9a3c9abfaa019fa8cc046f00d5bb","first_computed_at":"2026-07-05T10:59:28.521396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:59:28.521396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bcLi9EFzuVT3kBPeGbprCeBm3xGJSQ3rnXJSRIuYeT2BxnMhN+546WjrGuly63beLbbDKedjuWkjZeqD8+DABQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:59:28.521890Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.01501","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4616f78bb747e2fbf072a39fa86f100555185b6d23ad0a1eaa649a30fac5b646","sha256:910b048525652c5b99ba2c47cca27a4712993886e7531665c6258eb8da5b1a0a"],"state_sha256":"ca63218d893f211f5152f696af060539a8684ddd21687fb037aa3f3902932c6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EQ4NOgXQ54CrLzWbFGUQxO1xeEcWY9ueviASNjZ1jGkTxcvW0qXDI66egAYv63BTPx40EoGKjo7mveW1L0cCDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T22:48:03.358083Z","bundle_sha256":"eb1a3520b8f43826c30100c9560b6a6ae7beb1727ea3b60884a96d46c5d06cf6"}}