{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DNJTTY2GH6ZGMY3VHSMUMD3EVV","short_pith_number":"pith:DNJTTY2G","canonical_record":{"source":{"id":"1405.1576","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-07T11:44:24Z","cross_cats_sorted":[],"title_canon_sha256":"d339bec45204092f895442ec6328fc1cdbaa5457be8b994e257e87f2d8507c95","abstract_canon_sha256":"1bbd3c4f723bdcf6a157748c4028719d3f0d05c94115ec9d46faec92b230497d"},"schema_version":"1.0"},"canonical_sha256":"1b5339e3463fb26663753c99460f64ad4f635895a41b86e0bf9150b571543409","source":{"kind":"arxiv","id":"1405.1576","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1576","created_at":"2026-05-18T01:34:59Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1576v3","created_at":"2026-05-18T01:34:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1576","created_at":"2026-05-18T01:34:59Z"},{"alias_kind":"pith_short_12","alias_value":"DNJTTY2GH6ZG","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DNJTTY2GH6ZGMY3V","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DNJTTY2G","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DNJTTY2GH6ZGMY3VHSMUMD3EVV","target":"record","payload":{"canonical_record":{"source":{"id":"1405.1576","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-07T11:44:24Z","cross_cats_sorted":[],"title_canon_sha256":"d339bec45204092f895442ec6328fc1cdbaa5457be8b994e257e87f2d8507c95","abstract_canon_sha256":"1bbd3c4f723bdcf6a157748c4028719d3f0d05c94115ec9d46faec92b230497d"},"schema_version":"1.0"},"canonical_sha256":"1b5339e3463fb26663753c99460f64ad4f635895a41b86e0bf9150b571543409","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:59.311208Z","signature_b64":"rPYs03LO2HChTxOgDSU8/GPASTS2anmD46xsEwXCDC2J7rOlp26fKAMLQWiA4b2ykOv5HZqvgF1ndYubcZuNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b5339e3463fb26663753c99460f64ad4f635895a41b86e0bf9150b571543409","last_reissued_at":"2026-05-18T01:34:59.310524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:59.310524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.1576","source_version":3,"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-18T01:34:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O+0udZKV6BQkAGJx21hU01gucY6U+RgTGXsAJ2MJHNhrPuw0+7g0tky0nqyQAKS2EjMQdyJU06+/sFXnVOA7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:03:03.201659Z"},"content_sha256":"e0a78bc08f286fc77676a7244b1e5d8bbc7fb36fb83e052cc6ea994cbe6a9871","schema_version":"1.0","event_id":"sha256:e0a78bc08f286fc77676a7244b1e5d8bbc7fb36fb83e052cc6ea994cbe6a9871"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DNJTTY2GH6ZGMY3VHSMUMD3EVV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of 4-cycles in a tournament","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Avraham Morgenstern, Nati Linial","submitted_at":"2014-05-07T11:44:24Z","abstract_excerpt":"If $T$ is an $n$-vertex tournament with a given number of $3$-cycles, what can be said about the number of its $4$-cycles? The most interesting range of this problem is where $T$ is assumed to have $c\\cdot n^3$ cyclic triples for some $c>0$ and we seek to minimize the number of $4$-cycles. We conjecture that the (asymptotic) minimizing $T$ is a random blow-up of a constant-sized transitive tournament. Using the method of flag algebras, we derive a lower bound that almost matches the conjectured value. We are able to answer the easier problem of maximizing the number of $4$-cycles. These questi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1576","kind":"arxiv","version":3},"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-18T01:34:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PiPmkuWOz5t7MOS6xXBlNKON/zx5G/Dchxc0lK2K/nbZkAilGblZSxwzqZfNJuMi74/48WYbj7wQW+dx+E8GAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:03:03.202296Z"},"content_sha256":"5a66b4de9fa64d8ef534d641b2785c7997436fe4eae7e3c5e68cb6479cf31133","schema_version":"1.0","event_id":"sha256:5a66b4de9fa64d8ef534d641b2785c7997436fe4eae7e3c5e68cb6479cf31133"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DNJTTY2GH6ZGMY3VHSMUMD3EVV/bundle.json","state_url":"https://pith.science/pith/DNJTTY2GH6ZGMY3VHSMUMD3EVV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DNJTTY2GH6ZGMY3VHSMUMD3EVV/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-27T07:03:03Z","links":{"resolver":"https://pith.science/pith/DNJTTY2GH6ZGMY3VHSMUMD3EVV","bundle":"https://pith.science/pith/DNJTTY2GH6ZGMY3VHSMUMD3EVV/bundle.json","state":"https://pith.science/pith/DNJTTY2GH6ZGMY3VHSMUMD3EVV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DNJTTY2GH6ZGMY3VHSMUMD3EVV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DNJTTY2GH6ZGMY3VHSMUMD3EVV","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":"1bbd3c4f723bdcf6a157748c4028719d3f0d05c94115ec9d46faec92b230497d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-07T11:44:24Z","title_canon_sha256":"d339bec45204092f895442ec6328fc1cdbaa5457be8b994e257e87f2d8507c95"},"schema_version":"1.0","source":{"id":"1405.1576","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1576","created_at":"2026-05-18T01:34:59Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1576v3","created_at":"2026-05-18T01:34:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1576","created_at":"2026-05-18T01:34:59Z"},{"alias_kind":"pith_short_12","alias_value":"DNJTTY2GH6ZG","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DNJTTY2GH6ZGMY3V","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DNJTTY2G","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:5a66b4de9fa64d8ef534d641b2785c7997436fe4eae7e3c5e68cb6479cf31133","target":"graph","created_at":"2026-05-18T01:34:59Z","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":"If $T$ is an $n$-vertex tournament with a given number of $3$-cycles, what can be said about the number of its $4$-cycles? The most interesting range of this problem is where $T$ is assumed to have $c\\cdot n^3$ cyclic triples for some $c>0$ and we seek to minimize the number of $4$-cycles. We conjecture that the (asymptotic) minimizing $T$ is a random blow-up of a constant-sized transitive tournament. Using the method of flag algebras, we derive a lower bound that almost matches the conjectured value. We are able to answer the easier problem of maximizing the number of $4$-cycles. These questi","authors_text":"Avraham Morgenstern, Nati Linial","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-07T11:44:24Z","title":"On the number of 4-cycles in a tournament"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1576","kind":"arxiv","version":3},"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:e0a78bc08f286fc77676a7244b1e5d8bbc7fb36fb83e052cc6ea994cbe6a9871","target":"record","created_at":"2026-05-18T01:34:59Z","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":"1bbd3c4f723bdcf6a157748c4028719d3f0d05c94115ec9d46faec92b230497d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-07T11:44:24Z","title_canon_sha256":"d339bec45204092f895442ec6328fc1cdbaa5457be8b994e257e87f2d8507c95"},"schema_version":"1.0","source":{"id":"1405.1576","kind":"arxiv","version":3}},"canonical_sha256":"1b5339e3463fb26663753c99460f64ad4f635895a41b86e0bf9150b571543409","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b5339e3463fb26663753c99460f64ad4f635895a41b86e0bf9150b571543409","first_computed_at":"2026-05-18T01:34:59.310524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:59.310524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rPYs03LO2HChTxOgDSU8/GPASTS2anmD46xsEwXCDC2J7rOlp26fKAMLQWiA4b2ykOv5HZqvgF1ndYubcZuNAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:59.311208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1576","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0a78bc08f286fc77676a7244b1e5d8bbc7fb36fb83e052cc6ea994cbe6a9871","sha256:5a66b4de9fa64d8ef534d641b2785c7997436fe4eae7e3c5e68cb6479cf31133"],"state_sha256":"17f0665424dc2364fb05ceb69ab11a8a6d2cd2154c76dd0b417585e436489b1f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jKjzSlg4Vb0+Tb0ylZfIRe3CvwggzftAihpHb9Q2JASnJ6AarT2GNoQ5EIgeE0gfc7ouXh5v3gDS79X4Gto2Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:03:03.205847Z","bundle_sha256":"55990503056629b59bfc87029fcefb43193992511e25aaf178a6972e6c52961d"}}