{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CELPHEDP2GE6SAHEYLRZVM2HOT","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":"cac3fb66a1efe15558599a304e55c166adf4acc32d6925c1dfd7afd4bafa8fc5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-06T06:30:30Z","title_canon_sha256":"2aeb1e9c2064c5ce88449f5a5006bf37fc4278c39ae2f0a8ad40b5112d1aa4d6"},"schema_version":"1.0","source":{"id":"1501.01088","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01088","created_at":"2026-05-18T02:20:39Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01088v2","created_at":"2026-05-18T02:20:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01088","created_at":"2026-05-18T02:20:39Z"},{"alias_kind":"pith_short_12","alias_value":"CELPHEDP2GE6","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CELPHEDP2GE6SAHE","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CELPHEDP","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:64f8eab9dbd541b45116fd33e0c42624228829c0b8a5a2824f8c8e36ec190185","target":"graph","created_at":"2026-05-18T02:20:39Z","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":"It is shown that for $n\\geq 141$, among all triangle-free graphs on $n$ vertices, the complete equibipartite graph is the unique triangle-free graph with the greatest number of cycles.","authors_text":"Andrii Arman, David S. Gunderson, Sergei Tsaturian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-06T06:30:30Z","title":"Triangle-free graphs with the maximum number of cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01088","kind":"arxiv","version":2},"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:212ecb6563c0f4243cdf007e53a07801e7e006d2ca3280bf7004e00b47db991b","target":"record","created_at":"2026-05-18T02:20:39Z","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":"cac3fb66a1efe15558599a304e55c166adf4acc32d6925c1dfd7afd4bafa8fc5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-06T06:30:30Z","title_canon_sha256":"2aeb1e9c2064c5ce88449f5a5006bf37fc4278c39ae2f0a8ad40b5112d1aa4d6"},"schema_version":"1.0","source":{"id":"1501.01088","kind":"arxiv","version":2}},"canonical_sha256":"1116f3906fd189e900e4c2e39ab34774de7bd5a8e97842132b26712739f357d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1116f3906fd189e900e4c2e39ab34774de7bd5a8e97842132b26712739f357d7","first_computed_at":"2026-05-18T02:20:39.500118Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:39.500118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HhpEqxZsjKnQ9ittinBbWi5a1L93K/kflGN05/ddqSut0zd8Pk3LNETk5j5X5PdJUF7YAN1rg46dAjJDhDg9Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:39.500747Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.01088","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:212ecb6563c0f4243cdf007e53a07801e7e006d2ca3280bf7004e00b47db991b","sha256:64f8eab9dbd541b45116fd33e0c42624228829c0b8a5a2824f8c8e36ec190185"],"state_sha256":"a4a406927c68c376e8cb39f2ee19582ba4b1042cd327cef4633e77961db368d5"}