{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6BS4BLCXNN5XJZYFNWPIOVR4AC","short_pith_number":"pith:6BS4BLCX","schema_version":"1.0","canonical_sha256":"f065c0ac576b7b74e7056d9e87563c00866a02e4b611fbaaf689b942ef2fe76a","source":{"kind":"arxiv","id":"1406.6531","version":2},"attestation_state":"computed","paper":{"title":"The regularity method for graphs and digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amelia Taylor","submitted_at":"2014-06-25T11:53:18Z","abstract_excerpt":"This MSci thesis surveys results in extremal graph theory, in particular relating to Hamilton cycles. Szem\\'eredi's Regularity Lemma plays a central role. We also investigate the robust outexpansion property for digraphs. Kelly showed that every sufficiently large oriented graph on $n$ vertices with minimum in- and outdegree at least $3n/8 +o(n)$ contains any orientation of a Hamilton cycle. We use Kelly's arguments to extend his result to any robustly expanding digraph of linear degree."},"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":"1406.6531","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-25T11:53:18Z","cross_cats_sorted":[],"title_canon_sha256":"6de2ff344c3d5e58c99a1e5ad284772f92a2520d7d7264c6513321ef5fb9be87","abstract_canon_sha256":"184476b4035cf0acaffedec2e0fca4188b87f7eacd360d43f4dd3de3f837c3c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:54.396288Z","signature_b64":"dOClAzJWuwTn0aaymLfqWvAbK5emTY6oWxYvbzWZz0ySxbMslkoYqEtvc+sRtaiK0xQDrv9RLCocYOYl4etKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f065c0ac576b7b74e7056d9e87563c00866a02e4b611fbaaf689b942ef2fe76a","last_reissued_at":"2026-05-18T02:48:54.395744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:54.395744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The regularity method for graphs and digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amelia Taylor","submitted_at":"2014-06-25T11:53:18Z","abstract_excerpt":"This MSci thesis surveys results in extremal graph theory, in particular relating to Hamilton cycles. Szem\\'eredi's Regularity Lemma plays a central role. We also investigate the robust outexpansion property for digraphs. Kelly showed that every sufficiently large oriented graph on $n$ vertices with minimum in- and outdegree at least $3n/8 +o(n)$ contains any orientation of a Hamilton cycle. We use Kelly's arguments to extend his result to any robustly expanding digraph of linear degree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6531","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":"1406.6531","created_at":"2026-05-18T02:48:54.395832+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.6531v2","created_at":"2026-05-18T02:48:54.395832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6531","created_at":"2026-05-18T02:48:54.395832+00:00"},{"alias_kind":"pith_short_12","alias_value":"6BS4BLCXNN5X","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6BS4BLCXNN5XJZYF","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6BS4BLCX","created_at":"2026-05-18T12:28:16.859392+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/6BS4BLCXNN5XJZYFNWPIOVR4AC","json":"https://pith.science/pith/6BS4BLCXNN5XJZYFNWPIOVR4AC.json","graph_json":"https://pith.science/api/pith-number/6BS4BLCXNN5XJZYFNWPIOVR4AC/graph.json","events_json":"https://pith.science/api/pith-number/6BS4BLCXNN5XJZYFNWPIOVR4AC/events.json","paper":"https://pith.science/paper/6BS4BLCX"},"agent_actions":{"view_html":"https://pith.science/pith/6BS4BLCXNN5XJZYFNWPIOVR4AC","download_json":"https://pith.science/pith/6BS4BLCXNN5XJZYFNWPIOVR4AC.json","view_paper":"https://pith.science/paper/6BS4BLCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.6531&json=true","fetch_graph":"https://pith.science/api/pith-number/6BS4BLCXNN5XJZYFNWPIOVR4AC/graph.json","fetch_events":"https://pith.science/api/pith-number/6BS4BLCXNN5XJZYFNWPIOVR4AC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6BS4BLCXNN5XJZYFNWPIOVR4AC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6BS4BLCXNN5XJZYFNWPIOVR4AC/action/storage_attestation","attest_author":"https://pith.science/pith/6BS4BLCXNN5XJZYFNWPIOVR4AC/action/author_attestation","sign_citation":"https://pith.science/pith/6BS4BLCXNN5XJZYFNWPIOVR4AC/action/citation_signature","submit_replication":"https://pith.science/pith/6BS4BLCXNN5XJZYFNWPIOVR4AC/action/replication_record"}},"created_at":"2026-05-18T02:48:54.395832+00:00","updated_at":"2026-05-18T02:48:54.395832+00:00"}