{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:D73UZVGKXHWKPXGM6JWY4KI3E3","short_pith_number":"pith:D73UZVGK","schema_version":"1.0","canonical_sha256":"1ff74cd4cab9eca7dcccf26d8e291b26eb415848d107d5ff1ed7705de53af6cc","source":{"kind":"arxiv","id":"1011.4476","version":1},"attestation_state":"computed","paper":{"title":"A note on some embedding problems for oriented graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Treglown","submitted_at":"2010-11-19T17:20:39Z","abstract_excerpt":"We conjecture that every oriented graph $G$ on $n$ vertices with $\\delta ^+ (G) , \\delta ^- (G) \\geq 5n/12$ contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing of transitive triangles in an oriented graph. A link between Ramsey numbers and perfect packings of transitive tournaments is also considered."},"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":"1011.4476","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-19T17:20:39Z","cross_cats_sorted":[],"title_canon_sha256":"d0d4e5a7282355045322301449195e3208953a75d5e8978ba2f948d19c7484ba","abstract_canon_sha256":"318226fa59598e0de7eb7aea8cbf030609a756564ef4d68a80e4269fb8943d61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:14.071104Z","signature_b64":"zr9BoJU9Ip5EQ4iVFzE0rrRd82AnXx/xmhWAD7tUmsNvHztNM+hr8Hbtk7qYQ99etlXC5GRf5FtEfexY+jlgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ff74cd4cab9eca7dcccf26d8e291b26eb415848d107d5ff1ed7705de53af6cc","last_reissued_at":"2026-05-18T04:35:14.070374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:14.070374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on some embedding problems for oriented graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Treglown","submitted_at":"2010-11-19T17:20:39Z","abstract_excerpt":"We conjecture that every oriented graph $G$ on $n$ vertices with $\\delta ^+ (G) , \\delta ^- (G) \\geq 5n/12$ contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing of transitive triangles in an oriented graph. A link between Ramsey numbers and perfect packings of transitive tournaments is also considered."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4476","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":""},"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":"1011.4476","created_at":"2026-05-18T04:35:14.070481+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.4476v1","created_at":"2026-05-18T04:35:14.070481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4476","created_at":"2026-05-18T04:35:14.070481+00:00"},{"alias_kind":"pith_short_12","alias_value":"D73UZVGKXHWK","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"D73UZVGKXHWKPXGM","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"D73UZVGK","created_at":"2026-05-18T12:26:06.534383+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/D73UZVGKXHWKPXGM6JWY4KI3E3","json":"https://pith.science/pith/D73UZVGKXHWKPXGM6JWY4KI3E3.json","graph_json":"https://pith.science/api/pith-number/D73UZVGKXHWKPXGM6JWY4KI3E3/graph.json","events_json":"https://pith.science/api/pith-number/D73UZVGKXHWKPXGM6JWY4KI3E3/events.json","paper":"https://pith.science/paper/D73UZVGK"},"agent_actions":{"view_html":"https://pith.science/pith/D73UZVGKXHWKPXGM6JWY4KI3E3","download_json":"https://pith.science/pith/D73UZVGKXHWKPXGM6JWY4KI3E3.json","view_paper":"https://pith.science/paper/D73UZVGK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.4476&json=true","fetch_graph":"https://pith.science/api/pith-number/D73UZVGKXHWKPXGM6JWY4KI3E3/graph.json","fetch_events":"https://pith.science/api/pith-number/D73UZVGKXHWKPXGM6JWY4KI3E3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D73UZVGKXHWKPXGM6JWY4KI3E3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D73UZVGKXHWKPXGM6JWY4KI3E3/action/storage_attestation","attest_author":"https://pith.science/pith/D73UZVGKXHWKPXGM6JWY4KI3E3/action/author_attestation","sign_citation":"https://pith.science/pith/D73UZVGKXHWKPXGM6JWY4KI3E3/action/citation_signature","submit_replication":"https://pith.science/pith/D73UZVGKXHWKPXGM6JWY4KI3E3/action/replication_record"}},"created_at":"2026-05-18T04:35:14.070481+00:00","updated_at":"2026-05-18T04:35:14.070481+00:00"}