{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HFH4JUKA6G5HSDQQPLXXQTL67S","short_pith_number":"pith:HFH4JUKA","schema_version":"1.0","canonical_sha256":"394fc4d140f1ba790e107aef784d7efc89dfa3297479edc5517c70fbaf02929b","source":{"kind":"arxiv","id":"2606.02356","version":1},"attestation_state":"computed","paper":{"title":"On 2-connected graphs without cycles of length 1 modulo 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Binlong Li, Boram Park, Hojin Chu, Homoon Ryu, Yandong Bai","submitted_at":"2026-06-01T15:03:07Z","abstract_excerpt":"Burr and Erd\\H{o}s conjectured in 1976 that for all integers $k>\\ell\\geq 0$ such that $k\\mathbb{Z}+\\ell$ contains an even integer, every $n$-vertex graph without cycles of length $\\ell$ modulo $k$ has at most a linear number of edges in $n$. Bollob\\'{a}s confirmed the conjecture in 1977, and Erd\\H{o}s further asked for the exact extremal number. To the best of our knowledge, this problem has been solved only for all residues when $k\\leq 4$, and for $\\ell\\in \\{0,2\\}$ when $k\\geq 5$ is odd. In particular, Bai {\\it et al.} [arXiv:2503.03504] proved that if $G$ is an $n$-vertex graph with no cycle"},"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":"2606.02356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T15:03:07Z","cross_cats_sorted":[],"title_canon_sha256":"342098362657e61501669dd18d17bb0f4b76d3fdf2030d236ac0e730e7182bdb","abstract_canon_sha256":"27e0ae8bfbedfba4ffb295b066ae60ee47b404d69c82119b90c333f8743fd782"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T03:04:56.999702Z","signature_b64":"PDyQVQsYlsB+io0q2FokF8TobuBFNoUhT0WM6Mow1/dydxpav1VfD4Uz521pWXoMCSL8JbdeL7k2QYQs6cb1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"394fc4d140f1ba790e107aef784d7efc89dfa3297479edc5517c70fbaf02929b","last_reissued_at":"2026-06-02T03:04:56.999303Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T03:04:56.999303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On 2-connected graphs without cycles of length 1 modulo 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Binlong Li, Boram Park, Hojin Chu, Homoon Ryu, Yandong Bai","submitted_at":"2026-06-01T15:03:07Z","abstract_excerpt":"Burr and Erd\\H{o}s conjectured in 1976 that for all integers $k>\\ell\\geq 0$ such that $k\\mathbb{Z}+\\ell$ contains an even integer, every $n$-vertex graph without cycles of length $\\ell$ modulo $k$ has at most a linear number of edges in $n$. Bollob\\'{a}s confirmed the conjecture in 1977, and Erd\\H{o}s further asked for the exact extremal number. To the best of our knowledge, this problem has been solved only for all residues when $k\\leq 4$, and for $\\ell\\in \\{0,2\\}$ when $k\\geq 5$ is odd. In particular, Bai {\\it et al.} [arXiv:2503.03504] proved that if $G$ is an $n$-vertex graph with no cycle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02356","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/2606.02356/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":"2606.02356","created_at":"2026-06-02T03:04:56.999374+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.02356v1","created_at":"2026-06-02T03:04:56.999374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02356","created_at":"2026-06-02T03:04:56.999374+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFH4JUKA6G5H","created_at":"2026-06-02T03:04:56.999374+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFH4JUKA6G5HSDQQ","created_at":"2026-06-02T03:04:56.999374+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFH4JUKA","created_at":"2026-06-02T03:04:56.999374+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/HFH4JUKA6G5HSDQQPLXXQTL67S","json":"https://pith.science/pith/HFH4JUKA6G5HSDQQPLXXQTL67S.json","graph_json":"https://pith.science/api/pith-number/HFH4JUKA6G5HSDQQPLXXQTL67S/graph.json","events_json":"https://pith.science/api/pith-number/HFH4JUKA6G5HSDQQPLXXQTL67S/events.json","paper":"https://pith.science/paper/HFH4JUKA"},"agent_actions":{"view_html":"https://pith.science/pith/HFH4JUKA6G5HSDQQPLXXQTL67S","download_json":"https://pith.science/pith/HFH4JUKA6G5HSDQQPLXXQTL67S.json","view_paper":"https://pith.science/paper/HFH4JUKA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.02356&json=true","fetch_graph":"https://pith.science/api/pith-number/HFH4JUKA6G5HSDQQPLXXQTL67S/graph.json","fetch_events":"https://pith.science/api/pith-number/HFH4JUKA6G5HSDQQPLXXQTL67S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFH4JUKA6G5HSDQQPLXXQTL67S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFH4JUKA6G5HSDQQPLXXQTL67S/action/storage_attestation","attest_author":"https://pith.science/pith/HFH4JUKA6G5HSDQQPLXXQTL67S/action/author_attestation","sign_citation":"https://pith.science/pith/HFH4JUKA6G5HSDQQPLXXQTL67S/action/citation_signature","submit_replication":"https://pith.science/pith/HFH4JUKA6G5HSDQQPLXXQTL67S/action/replication_record"}},"created_at":"2026-06-02T03:04:56.999374+00:00","updated_at":"2026-06-02T03:04:56.999374+00:00"}