{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:ROMZ6UGN3SEGDGY5JAMOI5Z3ZB","short_pith_number":"pith:ROMZ6UGN","schema_version":"1.0","canonical_sha256":"8b999f50cddc88619b1d4818e4773bc8710e35e747e9e237eb78f9c329f2c77e","source":{"kind":"arxiv","id":"0910.1237","version":1},"attestation_state":"computed","paper":{"title":"The minimal density of triangles in tripartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Talbot, J. Robert Johnson, Rahil Baber","submitted_at":"2009-10-07T12:35:07Z","abstract_excerpt":"We determine the minimal density of triangles in a tripartite graph with prescribed edge densities. This extends a previous result of Bondy, Shen, Thomass\\'e and Thomassen characterizing those edge densities guaranteeing the existence of a triangle in a tripartite graph.\n  To be precise we show that a suitably weighted copy of the graph formed by deleting a certain 9-cycle from $K_{3,3,3}$ has minimal triangle density among all weighted tripartite graphs with prescribed edge densities."},"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":"0910.1237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-10-07T12:35:07Z","cross_cats_sorted":[],"title_canon_sha256":"8f094869432b7ed0add0be179affc7b28d1ed2ac0aefa66a323c1d778d0fe6eb","abstract_canon_sha256":"2dfa0cc25bc33862e86b859ba98bbd587c73ab4f8a9136d8959206f911de0327"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:19.895853Z","signature_b64":"2GfCElkmX5Yqsx+GpZfaOkxqh1mZ6j647WUKzkwjz/TbBaXzAMT258/OvSVzTCXeWJSBaCqqnGJnqc0+dYynBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b999f50cddc88619b1d4818e4773bc8710e35e747e9e237eb78f9c329f2c77e","last_reissued_at":"2026-05-17T23:53:19.895173Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:19.895173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The minimal density of triangles in tripartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Talbot, J. Robert Johnson, Rahil Baber","submitted_at":"2009-10-07T12:35:07Z","abstract_excerpt":"We determine the minimal density of triangles in a tripartite graph with prescribed edge densities. This extends a previous result of Bondy, Shen, Thomass\\'e and Thomassen characterizing those edge densities guaranteeing the existence of a triangle in a tripartite graph.\n  To be precise we show that a suitably weighted copy of the graph formed by deleting a certain 9-cycle from $K_{3,3,3}$ has minimal triangle density among all weighted tripartite graphs with prescribed edge densities."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.1237","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":"0910.1237","created_at":"2026-05-17T23:53:19.895274+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.1237v1","created_at":"2026-05-17T23:53:19.895274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.1237","created_at":"2026-05-17T23:53:19.895274+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROMZ6UGN3SEG","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROMZ6UGN3SEGDGY5","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROMZ6UGN","created_at":"2026-05-18T12:26:01.383474+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/ROMZ6UGN3SEGDGY5JAMOI5Z3ZB","json":"https://pith.science/pith/ROMZ6UGN3SEGDGY5JAMOI5Z3ZB.json","graph_json":"https://pith.science/api/pith-number/ROMZ6UGN3SEGDGY5JAMOI5Z3ZB/graph.json","events_json":"https://pith.science/api/pith-number/ROMZ6UGN3SEGDGY5JAMOI5Z3ZB/events.json","paper":"https://pith.science/paper/ROMZ6UGN"},"agent_actions":{"view_html":"https://pith.science/pith/ROMZ6UGN3SEGDGY5JAMOI5Z3ZB","download_json":"https://pith.science/pith/ROMZ6UGN3SEGDGY5JAMOI5Z3ZB.json","view_paper":"https://pith.science/paper/ROMZ6UGN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.1237&json=true","fetch_graph":"https://pith.science/api/pith-number/ROMZ6UGN3SEGDGY5JAMOI5Z3ZB/graph.json","fetch_events":"https://pith.science/api/pith-number/ROMZ6UGN3SEGDGY5JAMOI5Z3ZB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROMZ6UGN3SEGDGY5JAMOI5Z3ZB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROMZ6UGN3SEGDGY5JAMOI5Z3ZB/action/storage_attestation","attest_author":"https://pith.science/pith/ROMZ6UGN3SEGDGY5JAMOI5Z3ZB/action/author_attestation","sign_citation":"https://pith.science/pith/ROMZ6UGN3SEGDGY5JAMOI5Z3ZB/action/citation_signature","submit_replication":"https://pith.science/pith/ROMZ6UGN3SEGDGY5JAMOI5Z3ZB/action/replication_record"}},"created_at":"2026-05-17T23:53:19.895274+00:00","updated_at":"2026-05-17T23:53:19.895274+00:00"}