{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UJB3J6WM4KQNJ2LJTL7YJGZ7UH","short_pith_number":"pith:UJB3J6WM","schema_version":"1.0","canonical_sha256":"a243b4facce2a0d4e9699aff849b3fa1eabfa45c8f4874d1a2940cbf04400b81","source":{"kind":"arxiv","id":"1201.4912","version":1},"attestation_state":"computed","paper":{"title":"Extremal Graphs Without 4-Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Evan D. Nash, Frank A. Firke, Jason Williford, Peter M. Kosek","submitted_at":"2012-01-24T04:10:51Z","abstract_excerpt":"We prove an upper bound for the number of edges a C4-free graph on q^2 + q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity graph of a plane of even order q."},"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":"1201.4912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-24T04:10:51Z","cross_cats_sorted":[],"title_canon_sha256":"007f1678632c343545e46b7ff72c1a3205a8c1425a9149c597b288c06b0a122d","abstract_canon_sha256":"227da068eec3b1dca1c0d2c87a4dd9fee5df711c87e713c96f32ff25cd3529de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:04.819560Z","signature_b64":"H+iVjWu7NEfCV2V/UIy+y5T8FtD+YasjXsmpBBfSF8QzCW14syFegUlk68es69BEOBH2kvsoq2cWAUknNRBWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a243b4facce2a0d4e9699aff849b3fa1eabfa45c8f4874d1a2940cbf04400b81","last_reissued_at":"2026-05-18T04:04:04.819128Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:04.819128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extremal Graphs Without 4-Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Evan D. Nash, Frank A. Firke, Jason Williford, Peter M. Kosek","submitted_at":"2012-01-24T04:10:51Z","abstract_excerpt":"We prove an upper bound for the number of edges a C4-free graph on q^2 + q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity graph of a plane of even order q."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4912","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":"1201.4912","created_at":"2026-05-18T04:04:04.819191+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.4912v1","created_at":"2026-05-18T04:04:04.819191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4912","created_at":"2026-05-18T04:04:04.819191+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJB3J6WM4KQN","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJB3J6WM4KQNJ2LJ","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJB3J6WM","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/UJB3J6WM4KQNJ2LJTL7YJGZ7UH","json":"https://pith.science/pith/UJB3J6WM4KQNJ2LJTL7YJGZ7UH.json","graph_json":"https://pith.science/api/pith-number/UJB3J6WM4KQNJ2LJTL7YJGZ7UH/graph.json","events_json":"https://pith.science/api/pith-number/UJB3J6WM4KQNJ2LJTL7YJGZ7UH/events.json","paper":"https://pith.science/paper/UJB3J6WM"},"agent_actions":{"view_html":"https://pith.science/pith/UJB3J6WM4KQNJ2LJTL7YJGZ7UH","download_json":"https://pith.science/pith/UJB3J6WM4KQNJ2LJTL7YJGZ7UH.json","view_paper":"https://pith.science/paper/UJB3J6WM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.4912&json=true","fetch_graph":"https://pith.science/api/pith-number/UJB3J6WM4KQNJ2LJTL7YJGZ7UH/graph.json","fetch_events":"https://pith.science/api/pith-number/UJB3J6WM4KQNJ2LJTL7YJGZ7UH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJB3J6WM4KQNJ2LJTL7YJGZ7UH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJB3J6WM4KQNJ2LJTL7YJGZ7UH/action/storage_attestation","attest_author":"https://pith.science/pith/UJB3J6WM4KQNJ2LJTL7YJGZ7UH/action/author_attestation","sign_citation":"https://pith.science/pith/UJB3J6WM4KQNJ2LJTL7YJGZ7UH/action/citation_signature","submit_replication":"https://pith.science/pith/UJB3J6WM4KQNJ2LJTL7YJGZ7UH/action/replication_record"}},"created_at":"2026-05-18T04:04:04.819191+00:00","updated_at":"2026-05-18T04:04:04.819191+00:00"}