{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DNJTTY2GH6ZGMY3VHSMUMD3EVV","short_pith_number":"pith:DNJTTY2G","schema_version":"1.0","canonical_sha256":"1b5339e3463fb26663753c99460f64ad4f635895a41b86e0bf9150b571543409","source":{"kind":"arxiv","id":"1405.1576","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.1576","created_at":"2026-05-18T01:34:59.310633+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.1576v3","created_at":"2026-05-18T01:34:59.310633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1576","created_at":"2026-05-18T01:34:59.310633+00:00"},{"alias_kind":"pith_short_12","alias_value":"DNJTTY2GH6ZG","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DNJTTY2GH6ZGMY3V","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DNJTTY2G","created_at":"2026-05-18T12:28:25.294606+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/DNJTTY2GH6ZGMY3VHSMUMD3EVV","json":"https://pith.science/pith/DNJTTY2GH6ZGMY3VHSMUMD3EVV.json","graph_json":"https://pith.science/api/pith-number/DNJTTY2GH6ZGMY3VHSMUMD3EVV/graph.json","events_json":"https://pith.science/api/pith-number/DNJTTY2GH6ZGMY3VHSMUMD3EVV/events.json","paper":"https://pith.science/paper/DNJTTY2G"},"agent_actions":{"view_html":"https://pith.science/pith/DNJTTY2GH6ZGMY3VHSMUMD3EVV","download_json":"https://pith.science/pith/DNJTTY2GH6ZGMY3VHSMUMD3EVV.json","view_paper":"https://pith.science/paper/DNJTTY2G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.1576&json=true","fetch_graph":"https://pith.science/api/pith-number/DNJTTY2GH6ZGMY3VHSMUMD3EVV/graph.json","fetch_events":"https://pith.science/api/pith-number/DNJTTY2GH6ZGMY3VHSMUMD3EVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DNJTTY2GH6ZGMY3VHSMUMD3EVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DNJTTY2GH6ZGMY3VHSMUMD3EVV/action/storage_attestation","attest_author":"https://pith.science/pith/DNJTTY2GH6ZGMY3VHSMUMD3EVV/action/author_attestation","sign_citation":"https://pith.science/pith/DNJTTY2GH6ZGMY3VHSMUMD3EVV/action/citation_signature","submit_replication":"https://pith.science/pith/DNJTTY2GH6ZGMY3VHSMUMD3EVV/action/replication_record"}},"created_at":"2026-05-18T01:34:59.310633+00:00","updated_at":"2026-05-18T01:34:59.310633+00:00"}