{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LG2FRHPN6BUBUPCIJLHU2DM4MU","short_pith_number":"pith:LG2FRHPN","schema_version":"1.0","canonical_sha256":"59b4589dedf0681a3c484acf4d0d9c651e02daba99a69341a42f534ffd563d26","source":{"kind":"arxiv","id":"1707.07216","version":2},"attestation_state":"computed","paper":{"title":"Embedding graphs having Ore-degree at most five","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B\\'ela Csaba, Judit Nagy-Gy\\\"orgy","submitted_at":"2017-07-22T21:09:26Z","abstract_excerpt":"Let $H$ and $G$ be graphs on $n$ vertices, where $n$ is sufficiently large. We prove that if $H$ has Ore-degree at most 5 and $G$ has minimum degree at least $2n/3$ then $H\\subset G.$"},"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":"1707.07216","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-22T21:09:26Z","cross_cats_sorted":[],"title_canon_sha256":"5921dbc217726bdd6575ef4dc6c84881c9ba719f1260355f6259e66889909a16","abstract_canon_sha256":"d920eb17a396514d9b6bbb1facc35cdce5065e59d90f7cd0c6cf660fda0fc626"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:15.706228Z","signature_b64":"arezF4avlQ0u8poCWDICm9zWcNeWq42u901rJ38Gmr/4BJWJEdm5R72i0XXKU+TJ581//SMMaOpABOdMHZWlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59b4589dedf0681a3c484acf4d0d9c651e02daba99a69341a42f534ffd563d26","last_reissued_at":"2026-05-17T23:57:15.703342Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:15.703342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embedding graphs having Ore-degree at most five","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B\\'ela Csaba, Judit Nagy-Gy\\\"orgy","submitted_at":"2017-07-22T21:09:26Z","abstract_excerpt":"Let $H$ and $G$ be graphs on $n$ vertices, where $n$ is sufficiently large. We prove that if $H$ has Ore-degree at most 5 and $G$ has minimum degree at least $2n/3$ then $H\\subset G.$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07216","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":"1707.07216","created_at":"2026-05-17T23:57:15.703418+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.07216v2","created_at":"2026-05-17T23:57:15.703418+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07216","created_at":"2026-05-17T23:57:15.703418+00:00"},{"alias_kind":"pith_short_12","alias_value":"LG2FRHPN6BUB","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LG2FRHPN6BUBUPCI","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LG2FRHPN","created_at":"2026-05-18T12:31:28.150371+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/LG2FRHPN6BUBUPCIJLHU2DM4MU","json":"https://pith.science/pith/LG2FRHPN6BUBUPCIJLHU2DM4MU.json","graph_json":"https://pith.science/api/pith-number/LG2FRHPN6BUBUPCIJLHU2DM4MU/graph.json","events_json":"https://pith.science/api/pith-number/LG2FRHPN6BUBUPCIJLHU2DM4MU/events.json","paper":"https://pith.science/paper/LG2FRHPN"},"agent_actions":{"view_html":"https://pith.science/pith/LG2FRHPN6BUBUPCIJLHU2DM4MU","download_json":"https://pith.science/pith/LG2FRHPN6BUBUPCIJLHU2DM4MU.json","view_paper":"https://pith.science/paper/LG2FRHPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.07216&json=true","fetch_graph":"https://pith.science/api/pith-number/LG2FRHPN6BUBUPCIJLHU2DM4MU/graph.json","fetch_events":"https://pith.science/api/pith-number/LG2FRHPN6BUBUPCIJLHU2DM4MU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LG2FRHPN6BUBUPCIJLHU2DM4MU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LG2FRHPN6BUBUPCIJLHU2DM4MU/action/storage_attestation","attest_author":"https://pith.science/pith/LG2FRHPN6BUBUPCIJLHU2DM4MU/action/author_attestation","sign_citation":"https://pith.science/pith/LG2FRHPN6BUBUPCIJLHU2DM4MU/action/citation_signature","submit_replication":"https://pith.science/pith/LG2FRHPN6BUBUPCIJLHU2DM4MU/action/replication_record"}},"created_at":"2026-05-17T23:57:15.703418+00:00","updated_at":"2026-05-17T23:57:15.703418+00:00"}