{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:E6CGS6H2EERO54MFNOYUEJWAXS","short_pith_number":"pith:E6CGS6H2","schema_version":"1.0","canonical_sha256":"27846978fa2122eef1856bb14226c0bca6ba8577fb0b2d9513a5e238506a5138","source":{"kind":"arxiv","id":"1204.4515","version":1},"attestation_state":"computed","paper":{"title":"A note on directed 4-cycles in digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hao Liang, Jun-Ming Xu","submitted_at":"2012-04-20T01:55:47Z","abstract_excerpt":"Using some combinatorial techniques, in this note, it is proved that if $\\alpha\\geq 0.28866$, then any digraph on $n$ vertices with minimum outdegree at least $\\alpha n$ contains a directed cycle of length at most 4."},"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":"1204.4515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-20T01:55:47Z","cross_cats_sorted":[],"title_canon_sha256":"1776ac78cc273fc5d1e0133ae82597dd6a01df80499e02dd1b021321ce236059","abstract_canon_sha256":"a1329910cb026744043fb6b0842e06770a381dd5adfbef718aebe924f1ac89a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:26.349651Z","signature_b64":"eXFjfieNUsiPDxeVref9i9usk24nipKe+YgT11biM/EiqbSPj8jvi3TAb3M2sSm4Oh7a+2zwiiq/euQsQtp9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27846978fa2122eef1856bb14226c0bca6ba8577fb0b2d9513a5e238506a5138","last_reissued_at":"2026-05-18T03:57:26.348875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:26.348875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on directed 4-cycles in digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hao Liang, Jun-Ming Xu","submitted_at":"2012-04-20T01:55:47Z","abstract_excerpt":"Using some combinatorial techniques, in this note, it is proved that if $\\alpha\\geq 0.28866$, then any digraph on $n$ vertices with minimum outdegree at least $\\alpha n$ contains a directed cycle of length at most 4."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4515","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":"1204.4515","created_at":"2026-05-18T03:57:26.349022+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.4515v1","created_at":"2026-05-18T03:57:26.349022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4515","created_at":"2026-05-18T03:57:26.349022+00:00"},{"alias_kind":"pith_short_12","alias_value":"E6CGS6H2EERO","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"E6CGS6H2EERO54MF","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"E6CGS6H2","created_at":"2026-05-18T12:27:04.183437+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/E6CGS6H2EERO54MFNOYUEJWAXS","json":"https://pith.science/pith/E6CGS6H2EERO54MFNOYUEJWAXS.json","graph_json":"https://pith.science/api/pith-number/E6CGS6H2EERO54MFNOYUEJWAXS/graph.json","events_json":"https://pith.science/api/pith-number/E6CGS6H2EERO54MFNOYUEJWAXS/events.json","paper":"https://pith.science/paper/E6CGS6H2"},"agent_actions":{"view_html":"https://pith.science/pith/E6CGS6H2EERO54MFNOYUEJWAXS","download_json":"https://pith.science/pith/E6CGS6H2EERO54MFNOYUEJWAXS.json","view_paper":"https://pith.science/paper/E6CGS6H2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.4515&json=true","fetch_graph":"https://pith.science/api/pith-number/E6CGS6H2EERO54MFNOYUEJWAXS/graph.json","fetch_events":"https://pith.science/api/pith-number/E6CGS6H2EERO54MFNOYUEJWAXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E6CGS6H2EERO54MFNOYUEJWAXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E6CGS6H2EERO54MFNOYUEJWAXS/action/storage_attestation","attest_author":"https://pith.science/pith/E6CGS6H2EERO54MFNOYUEJWAXS/action/author_attestation","sign_citation":"https://pith.science/pith/E6CGS6H2EERO54MFNOYUEJWAXS/action/citation_signature","submit_replication":"https://pith.science/pith/E6CGS6H2EERO54MFNOYUEJWAXS/action/replication_record"}},"created_at":"2026-05-18T03:57:26.349022+00:00","updated_at":"2026-05-18T03:57:26.349022+00:00"}