{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:URS5ZQMX6GPBBA3QDVGKZLZIMO","short_pith_number":"pith:URS5ZQMX","schema_version":"1.0","canonical_sha256":"a465dcc197f19e1083701d4cacaf28639d06ee45b7b719759743245384625fd1","source":{"kind":"arxiv","id":"1204.2846","version":2},"attestation_state":"computed","paper":{"title":"Asymptotic Structure of Graphs with the Minimum Number of Triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Razborov, Oleg Pikhurko","submitted_at":"2012-04-12T21:58:07Z","abstract_excerpt":"We consider the problem of minimizing the number of triangles in a graph of given order and size and describe the asymptotic structure of extremal graphs. This is achieved by characterizing the set of flag algebra homomorphisms that minimize the triangle density."},"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":"1204.2846","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-12T21:58:07Z","cross_cats_sorted":[],"title_canon_sha256":"f19642604616139494f8638ea12c0f94ff74bae0a7c6ce29f60f67d3c33ad1cb","abstract_canon_sha256":"d267ee1793d3de6d81e27e12bfea17a46ce8ce1a08407c911382e67af21715b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:15.647067Z","signature_b64":"i9WJZAvpuUEuzryJrGe4B+iByLzwA0XgJRuASP+UTSOuVHqtvQFOnk9VuDi9IHYaK8wYl3f47I+AMmLyARjZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a465dcc197f19e1083701d4cacaf28639d06ee45b7b719759743245384625fd1","last_reissued_at":"2026-05-18T01:15:15.646363Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:15.646363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic Structure of Graphs with the Minimum Number of Triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Razborov, Oleg Pikhurko","submitted_at":"2012-04-12T21:58:07Z","abstract_excerpt":"We consider the problem of minimizing the number of triangles in a graph of given order and size and describe the asymptotic structure of extremal graphs. This is achieved by characterizing the set of flag algebra homomorphisms that minimize the triangle density."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2846","kind":"arxiv","version":2},"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":"1204.2846","created_at":"2026-05-18T01:15:15.646484+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.2846v2","created_at":"2026-05-18T01:15:15.646484+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2846","created_at":"2026-05-18T01:15:15.646484+00:00"},{"alias_kind":"pith_short_12","alias_value":"URS5ZQMX6GPB","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"URS5ZQMX6GPBBA3Q","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"URS5ZQMX","created_at":"2026-05-18T12:27:23.164592+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/URS5ZQMX6GPBBA3QDVGKZLZIMO","json":"https://pith.science/pith/URS5ZQMX6GPBBA3QDVGKZLZIMO.json","graph_json":"https://pith.science/api/pith-number/URS5ZQMX6GPBBA3QDVGKZLZIMO/graph.json","events_json":"https://pith.science/api/pith-number/URS5ZQMX6GPBBA3QDVGKZLZIMO/events.json","paper":"https://pith.science/paper/URS5ZQMX"},"agent_actions":{"view_html":"https://pith.science/pith/URS5ZQMX6GPBBA3QDVGKZLZIMO","download_json":"https://pith.science/pith/URS5ZQMX6GPBBA3QDVGKZLZIMO.json","view_paper":"https://pith.science/paper/URS5ZQMX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.2846&json=true","fetch_graph":"https://pith.science/api/pith-number/URS5ZQMX6GPBBA3QDVGKZLZIMO/graph.json","fetch_events":"https://pith.science/api/pith-number/URS5ZQMX6GPBBA3QDVGKZLZIMO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/URS5ZQMX6GPBBA3QDVGKZLZIMO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/URS5ZQMX6GPBBA3QDVGKZLZIMO/action/storage_attestation","attest_author":"https://pith.science/pith/URS5ZQMX6GPBBA3QDVGKZLZIMO/action/author_attestation","sign_citation":"https://pith.science/pith/URS5ZQMX6GPBBA3QDVGKZLZIMO/action/citation_signature","submit_replication":"https://pith.science/pith/URS5ZQMX6GPBBA3QDVGKZLZIMO/action/replication_record"}},"created_at":"2026-05-18T01:15:15.646484+00:00","updated_at":"2026-05-18T01:15:15.646484+00:00"}