{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:GBTGNF3CLGGAU3Y5LB2NH3MR3I","short_pith_number":"pith:GBTGNF3C","schema_version":"1.0","canonical_sha256":"3066669762598c0a6f1d5874d3ed91da2e60398c1b56da4cbc8b6dde90aa4347","source":{"kind":"arxiv","id":"0711.4394","version":2},"attestation_state":"computed","paper":{"title":"A note on a degree sum condition for long cycles in graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Janusz Adamus","submitted_at":"2007-11-28T01:00:01Z","abstract_excerpt":"We conjecture that a 2-connected graph $G$ of order $n$, in which $d(x)+d(y)\\geq n-k$ for every pair of non-adjacent vertices $x$ and $y$, contains a cycle of length $n-k$ ($k<n/2$), unless $G$ is bipartite and $n-k$ is odd. This generalizes to long cycles a well-known degree sum condition for hamiltonicity of Ore. The conjecture is shown to hold for $k=1$."},"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":"0711.4394","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2007-11-28T01:00:01Z","cross_cats_sorted":[],"title_canon_sha256":"3c1b18b8d04c384972874d492a4f717dee717982cbf4ead8ab73523d034a5a6a","abstract_canon_sha256":"15cdc71a5dfdd47fd270fd81d69d6dd405480e7129223e54031fae288f9869bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:04.471998Z","signature_b64":"NbrBenj7HWzxO7Ghap/kBzkQU9Xh9LqRu7CduMqimuORujjoE/3+AWbn06uN1x3QEesy4/npaTi0AIPdTGSTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3066669762598c0a6f1d5874d3ed91da2e60398c1b56da4cbc8b6dde90aa4347","last_reissued_at":"2026-05-18T04:09:04.471309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:04.471309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on a degree sum condition for long cycles in graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Janusz Adamus","submitted_at":"2007-11-28T01:00:01Z","abstract_excerpt":"We conjecture that a 2-connected graph $G$ of order $n$, in which $d(x)+d(y)\\geq n-k$ for every pair of non-adjacent vertices $x$ and $y$, contains a cycle of length $n-k$ ($k<n/2$), unless $G$ is bipartite and $n-k$ is odd. This generalizes to long cycles a well-known degree sum condition for hamiltonicity of Ore. The conjecture is shown to hold for $k=1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0711.4394","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":""},"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":"0711.4394","created_at":"2026-05-18T04:09:04.471434+00:00"},{"alias_kind":"arxiv_version","alias_value":"0711.4394v2","created_at":"2026-05-18T04:09:04.471434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0711.4394","created_at":"2026-05-18T04:09:04.471434+00:00"},{"alias_kind":"pith_short_12","alias_value":"GBTGNF3CLGGA","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"GBTGNF3CLGGAU3Y5","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"GBTGNF3C","created_at":"2026-05-18T12:25:55.427421+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/GBTGNF3CLGGAU3Y5LB2NH3MR3I","json":"https://pith.science/pith/GBTGNF3CLGGAU3Y5LB2NH3MR3I.json","graph_json":"https://pith.science/api/pith-number/GBTGNF3CLGGAU3Y5LB2NH3MR3I/graph.json","events_json":"https://pith.science/api/pith-number/GBTGNF3CLGGAU3Y5LB2NH3MR3I/events.json","paper":"https://pith.science/paper/GBTGNF3C"},"agent_actions":{"view_html":"https://pith.science/pith/GBTGNF3CLGGAU3Y5LB2NH3MR3I","download_json":"https://pith.science/pith/GBTGNF3CLGGAU3Y5LB2NH3MR3I.json","view_paper":"https://pith.science/paper/GBTGNF3C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0711.4394&json=true","fetch_graph":"https://pith.science/api/pith-number/GBTGNF3CLGGAU3Y5LB2NH3MR3I/graph.json","fetch_events":"https://pith.science/api/pith-number/GBTGNF3CLGGAU3Y5LB2NH3MR3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GBTGNF3CLGGAU3Y5LB2NH3MR3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GBTGNF3CLGGAU3Y5LB2NH3MR3I/action/storage_attestation","attest_author":"https://pith.science/pith/GBTGNF3CLGGAU3Y5LB2NH3MR3I/action/author_attestation","sign_citation":"https://pith.science/pith/GBTGNF3CLGGAU3Y5LB2NH3MR3I/action/citation_signature","submit_replication":"https://pith.science/pith/GBTGNF3CLGGAU3Y5LB2NH3MR3I/action/replication_record"}},"created_at":"2026-05-18T04:09:04.471434+00:00","updated_at":"2026-05-18T04:09:04.471434+00:00"}