{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VF3SXTAGXCALHKUUPLIB2VPNY6","short_pith_number":"pith:VF3SXTAG","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"},"canonical_sha256":"a9772bcc06b880b3aa947ad01d55edc7a93f49b3e3278e6839bc416526049f89","source":{"kind":"arxiv","id":"1409.0972","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0972","created_at":"2026-05-18T02:43:44Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0972v1","created_at":"2026-05-18T02:43:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0972","created_at":"2026-05-18T02:43:44Z"},{"alias_kind":"pith_short_12","alias_value":"VF3SXTAGXCAL","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"VF3SXTAGXCALHKUU","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"VF3SXTAG","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VF3SXTAGXCALHKUUPLIB2VPNY6","target":"record","payload":{"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"},"canonical_sha256":"a9772bcc06b880b3aa947ad01d55edc7a93f49b3e3278e6839bc416526049f89","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"},"source_kind":"arxiv","source_id":"1409.0972","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W8xZl5B8qE+31Yn8ffLeeNciNue+U1LSHcKE4bcuBiB/M2XYAsMnja1ztIhlWxWtYsL0nizEJ0p+2h/w3KKrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T16:16:09.176407Z"},"content_sha256":"55f5010eb0b6fc4a54c60163ba448132a2fbc9cf4c6236fa2d1d11f072d08bde","schema_version":"1.0","event_id":"sha256:55f5010eb0b6fc4a54c60163ba448132a2fbc9cf4c6236fa2d1d11f072d08bde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VF3SXTAGXCALHKUUPLIB2VPNY6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CrDT2XJ0GrpfbSJ6/e/2AsQa8liT7QsC/p8Db3lijA1PmIeijVRmKWkuy41ZoJ2mne1Lvh0mTqPrN8y+oqCGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T16:16:09.176978Z"},"content_sha256":"9b8e25720e45f00b1dc76345ed2e070b50d6068b09a976d21e1a3a196677445d","schema_version":"1.0","event_id":"sha256:9b8e25720e45f00b1dc76345ed2e070b50d6068b09a976d21e1a3a196677445d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VF3SXTAGXCALHKUUPLIB2VPNY6/bundle.json","state_url":"https://pith.science/pith/VF3SXTAGXCALHKUUPLIB2VPNY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VF3SXTAGXCALHKUUPLIB2VPNY6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-19T16:16:09Z","links":{"resolver":"https://pith.science/pith/VF3SXTAGXCALHKUUPLIB2VPNY6","bundle":"https://pith.science/pith/VF3SXTAGXCALHKUUPLIB2VPNY6/bundle.json","state":"https://pith.science/pith/VF3SXTAGXCALHKUUPLIB2VPNY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VF3SXTAGXCALHKUUPLIB2VPNY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VF3SXTAGXCALHKUUPLIB2VPNY6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b02122c230fd0094ade37b589a0971938fb922cb29ad4f598453f13f99a3f58e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-03T07:14:37Z","title_canon_sha256":"6557df6abbca7d67a592e39bd09db4bcdb92242878296d1f368121cf2ac0f4f5"},"schema_version":"1.0","source":{"id":"1409.0972","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0972","created_at":"2026-05-18T02:43:44Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0972v1","created_at":"2026-05-18T02:43:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0972","created_at":"2026-05-18T02:43:44Z"},{"alias_kind":"pith_short_12","alias_value":"VF3SXTAGXCAL","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"VF3SXTAGXCALHKUU","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"VF3SXTAG","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:9b8e25720e45f00b1dc76345ed2e070b50d6068b09a976d21e1a3a196677445d","target":"graph","created_at":"2026-05-18T02:43:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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}","authors_text":"Imre Leader, Ta Sheng Tan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-03T07:14:37Z","title":"Cycles in Oriented 3-graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0972","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:55f5010eb0b6fc4a54c60163ba448132a2fbc9cf4c6236fa2d1d11f072d08bde","target":"record","created_at":"2026-05-18T02:43:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b02122c230fd0094ade37b589a0971938fb922cb29ad4f598453f13f99a3f58e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-03T07:14:37Z","title_canon_sha256":"6557df6abbca7d67a592e39bd09db4bcdb92242878296d1f368121cf2ac0f4f5"},"schema_version":"1.0","source":{"id":"1409.0972","kind":"arxiv","version":1}},"canonical_sha256":"a9772bcc06b880b3aa947ad01d55edc7a93f49b3e3278e6839bc416526049f89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9772bcc06b880b3aa947ad01d55edc7a93f49b3e3278e6839bc416526049f89","first_computed_at":"2026-05-18T02:43:44.662954Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:44.662954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FIQU71ouRo4eOaHibcXoNqLv21Sybb0yQpaIOYjnxhovrE2gMeEeoK3Ak7A6DCJ/9htm/dUhyvtZ+CjU8EL7BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:44.663365Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.0972","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55f5010eb0b6fc4a54c60163ba448132a2fbc9cf4c6236fa2d1d11f072d08bde","sha256:9b8e25720e45f00b1dc76345ed2e070b50d6068b09a976d21e1a3a196677445d"],"state_sha256":"f407d8441c117fbb99c08d3c18d17b09556967053c630df379784b83ba075e5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eXJnbJ3Im7wh9x15kBp4wYZ6al0q4wlUzm4L/qS3yy5VHmAvruiYt7jZxeoqONXrgVBeGESE+kYBzXQs/s3sBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T16:16:09.180924Z","bundle_sha256":"0912695a9d2519b4f1a6bc4fc13945863e0b8c60c3d818d9e84e9c1251460f8b"}}