{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VF3SXTAGXCALHKUUPLIB2VPNY6","short_pith_number":"pith:VF3SXTAG","schema_version":"1.0","canonical_sha256":"a9772bcc06b880b3aa947ad01d55edc7a93f49b3e3278e6839bc416526049f89","source":{"kind":"arxiv","id":"1409.0972","version":1},"attestation_state":"computed","paper":{"title":"Cycles in Oriented 3-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Imre Leader, Ta Sheng Tan","submitted_at":"2014-09-03T07:14:37Z","abstract_excerpt":"An oriented 3-graph consists of a family of triples (3-sets), each of which is given one of its two possible cyclic orientations. A cycle in an oriented 3-graph is a positive sum of some of the triples that gives weight zero to each 2-set.\n  Our aim in this paper is to consider the following question: how large can the girth of an oriented 3-graph (on $n$ vertices) be? We show that there exist oriented 3-graphs whose shortest cycle has length $\\frac{n^2}{2}(1+o(1))$: this is asymptotically best possible. We also show that there exist 3-tournaments whose shortest cycle has length $\\frac{n^2}{3}"},"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":"1409.0972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-03T07:14:37Z","cross_cats_sorted":[],"title_canon_sha256":"6557df6abbca7d67a592e39bd09db4bcdb92242878296d1f368121cf2ac0f4f5","abstract_canon_sha256":"b02122c230fd0094ade37b589a0971938fb922cb29ad4f598453f13f99a3f58e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:44.663365Z","signature_b64":"FIQU71ouRo4eOaHibcXoNqLv21Sybb0yQpaIOYjnxhovrE2gMeEeoK3Ak7A6DCJ/9htm/dUhyvtZ+CjU8EL7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9772bcc06b880b3aa947ad01d55edc7a93f49b3e3278e6839bc416526049f89","last_reissued_at":"2026-05-18T02:43:44.662954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:44.662954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cycles in Oriented 3-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Imre Leader, Ta Sheng Tan","submitted_at":"2014-09-03T07:14:37Z","abstract_excerpt":"An oriented 3-graph consists of a family of triples (3-sets), each of which is given one of its two possible cyclic orientations. A cycle in an oriented 3-graph is a positive sum of some of the triples that gives weight zero to each 2-set.\n  Our aim in this paper is to consider the following question: how large can the girth of an oriented 3-graph (on $n$ vertices) be? We show that there exist oriented 3-graphs whose shortest cycle has length $\\frac{n^2}{2}(1+o(1))$: this is asymptotically best possible. We also show that there exist 3-tournaments whose shortest cycle has length $\\frac{n^2}{3}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0972","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":"1409.0972","created_at":"2026-05-18T02:43:44.663020+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.0972v1","created_at":"2026-05-18T02:43:44.663020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0972","created_at":"2026-05-18T02:43:44.663020+00:00"},{"alias_kind":"pith_short_12","alias_value":"VF3SXTAGXCAL","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"VF3SXTAGXCALHKUU","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"VF3SXTAG","created_at":"2026-05-18T12:28:52.271510+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/VF3SXTAGXCALHKUUPLIB2VPNY6","json":"https://pith.science/pith/VF3SXTAGXCALHKUUPLIB2VPNY6.json","graph_json":"https://pith.science/api/pith-number/VF3SXTAGXCALHKUUPLIB2VPNY6/graph.json","events_json":"https://pith.science/api/pith-number/VF3SXTAGXCALHKUUPLIB2VPNY6/events.json","paper":"https://pith.science/paper/VF3SXTAG"},"agent_actions":{"view_html":"https://pith.science/pith/VF3SXTAGXCALHKUUPLIB2VPNY6","download_json":"https://pith.science/pith/VF3SXTAGXCALHKUUPLIB2VPNY6.json","view_paper":"https://pith.science/paper/VF3SXTAG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.0972&json=true","fetch_graph":"https://pith.science/api/pith-number/VF3SXTAGXCALHKUUPLIB2VPNY6/graph.json","fetch_events":"https://pith.science/api/pith-number/VF3SXTAGXCALHKUUPLIB2VPNY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VF3SXTAGXCALHKUUPLIB2VPNY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VF3SXTAGXCALHKUUPLIB2VPNY6/action/storage_attestation","attest_author":"https://pith.science/pith/VF3SXTAGXCALHKUUPLIB2VPNY6/action/author_attestation","sign_citation":"https://pith.science/pith/VF3SXTAGXCALHKUUPLIB2VPNY6/action/citation_signature","submit_replication":"https://pith.science/pith/VF3SXTAGXCALHKUUPLIB2VPNY6/action/replication_record"}},"created_at":"2026-05-18T02:43:44.663020+00:00","updated_at":"2026-05-18T02:43:44.663020+00:00"}