{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CELPHEDP2GE6SAHEYLRZVM2HOT","short_pith_number":"pith:CELPHEDP","schema_version":"1.0","canonical_sha256":"1116f3906fd189e900e4c2e39ab34774de7bd5a8e97842132b26712739f357d7","source":{"kind":"arxiv","id":"1501.01088","version":2},"attestation_state":"computed","paper":{"title":"Triangle-free graphs with the maximum number of cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrii Arman, David S. Gunderson, Sergei Tsaturian","submitted_at":"2015-01-06T06:30:30Z","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."},"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":"1501.01088","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-06T06:30:30Z","cross_cats_sorted":[],"title_canon_sha256":"2aeb1e9c2064c5ce88449f5a5006bf37fc4278c39ae2f0a8ad40b5112d1aa4d6","abstract_canon_sha256":"cac3fb66a1efe15558599a304e55c166adf4acc32d6925c1dfd7afd4bafa8fc5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:39.500747Z","signature_b64":"HhpEqxZsjKnQ9ittinBbWi5a1L93K/kflGN05/ddqSut0zd8Pk3LNETk5j5X5PdJUF7YAN1rg46dAjJDhDg9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1116f3906fd189e900e4c2e39ab34774de7bd5a8e97842132b26712739f357d7","last_reissued_at":"2026-05-18T02:20:39.500118Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:39.500118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Triangle-free graphs with the maximum number of cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrii Arman, David S. Gunderson, Sergei Tsaturian","submitted_at":"2015-01-06T06:30:30Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01088","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":"1501.01088","created_at":"2026-05-18T02:20:39.500201+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01088v2","created_at":"2026-05-18T02:20:39.500201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01088","created_at":"2026-05-18T02:20:39.500201+00:00"},{"alias_kind":"pith_short_12","alias_value":"CELPHEDP2GE6","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"CELPHEDP2GE6SAHE","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"CELPHEDP","created_at":"2026-05-18T12:29:14.074870+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/CELPHEDP2GE6SAHEYLRZVM2HOT","json":"https://pith.science/pith/CELPHEDP2GE6SAHEYLRZVM2HOT.json","graph_json":"https://pith.science/api/pith-number/CELPHEDP2GE6SAHEYLRZVM2HOT/graph.json","events_json":"https://pith.science/api/pith-number/CELPHEDP2GE6SAHEYLRZVM2HOT/events.json","paper":"https://pith.science/paper/CELPHEDP"},"agent_actions":{"view_html":"https://pith.science/pith/CELPHEDP2GE6SAHEYLRZVM2HOT","download_json":"https://pith.science/pith/CELPHEDP2GE6SAHEYLRZVM2HOT.json","view_paper":"https://pith.science/paper/CELPHEDP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01088&json=true","fetch_graph":"https://pith.science/api/pith-number/CELPHEDP2GE6SAHEYLRZVM2HOT/graph.json","fetch_events":"https://pith.science/api/pith-number/CELPHEDP2GE6SAHEYLRZVM2HOT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CELPHEDP2GE6SAHEYLRZVM2HOT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CELPHEDP2GE6SAHEYLRZVM2HOT/action/storage_attestation","attest_author":"https://pith.science/pith/CELPHEDP2GE6SAHEYLRZVM2HOT/action/author_attestation","sign_citation":"https://pith.science/pith/CELPHEDP2GE6SAHEYLRZVM2HOT/action/citation_signature","submit_replication":"https://pith.science/pith/CELPHEDP2GE6SAHEYLRZVM2HOT/action/replication_record"}},"created_at":"2026-05-18T02:20:39.500201+00:00","updated_at":"2026-05-18T02:20:39.500201+00:00"}