{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EIJLSRQPZ3D7KFWBNMGR45XKYS","short_pith_number":"pith:EIJLSRQP","canonical_record":{"source":{"id":"1310.5172","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-18T21:56:36Z","cross_cats_sorted":[],"title_canon_sha256":"4b3c376afaeb10b4e48fdca9b53c4beefa908d88054dc383a0f91642093f711e","abstract_canon_sha256":"be032426caa8bc577bea28ceadb54cd97e432dfc3637565f7b922095a97b9612"},"schema_version":"1.0"},"canonical_sha256":"2212b9460fcec7f516c16b0d1e76eac4b8db336f24fa12b07325376d8e1613ca","source":{"kind":"arxiv","id":"1310.5172","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5172","created_at":"2026-05-18T02:39:09Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5172v2","created_at":"2026-05-18T02:39:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5172","created_at":"2026-05-18T02:39:09Z"},{"alias_kind":"pith_short_12","alias_value":"EIJLSRQPZ3D7","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EIJLSRQPZ3D7KFWB","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EIJLSRQP","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EIJLSRQPZ3D7KFWBNMGR45XKYS","target":"record","payload":{"canonical_record":{"source":{"id":"1310.5172","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-18T21:56:36Z","cross_cats_sorted":[],"title_canon_sha256":"4b3c376afaeb10b4e48fdca9b53c4beefa908d88054dc383a0f91642093f711e","abstract_canon_sha256":"be032426caa8bc577bea28ceadb54cd97e432dfc3637565f7b922095a97b9612"},"schema_version":"1.0"},"canonical_sha256":"2212b9460fcec7f516c16b0d1e76eac4b8db336f24fa12b07325376d8e1613ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:09.032205Z","signature_b64":"/mvpake7ETwuNT2Jahau8yoqOYIXOvAEQvHeG/flZCowPNJvZZ5ocXfTMSpxr6hBjvyI3aulrPBshwlETW4wBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2212b9460fcec7f516c16b0d1e76eac4b8db336f24fa12b07325376d8e1613ca","last_reissued_at":"2026-05-18T02:39:09.031698Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:09.031698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.5172","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:39:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FJDcprhRLniv6KAA8BxLyAWSblnfijSwztAib/GLJy1s9HRESJ0SGLzs3Q89TkbTb8N6YUeozWj6LOufCdn1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:22:58.028509Z"},"content_sha256":"5e4adc4554e090a97a997ab9311d1339fc3400d928feec4f6977f0d329387e96","schema_version":"1.0","event_id":"sha256:5e4adc4554e090a97a997ab9311d1339fc3400d928feec4f6977f0d329387e96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EIJLSRQPZ3D7KFWBNMGR45XKYS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cycle-maximal triangle-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David S. Gunderson, Matthew Skala, Pak Ching Li, Stephane Durocher","submitted_at":"2013-10-18T21:56:36Z","abstract_excerpt":"We conjecture that the balanced complete bipartite graph $K_{\\lfloor n/2 \\rfloor,\\lceil n/2 \\rceil}$ contains more cycles than any other $n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent conditions for cycle-maximal triangle-free graphs; show bounds on the numbers of cycles in graphs depending on numbers of vertices and edges, girth, and homomorphisms to small fixed graphs; and use the bounds to show that among regular graphs, the conjecture holds. We also consider graphs that are close to being regular, with the minimum and maximum degrees diffe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5172","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:39:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IL36XDLAShoqO1Hek3zB3sHBDugFSsmlzFeDfN7mhf2PuYW5hSpxG3o9nZbmcqaO2SD8ZcBNm06edcSNw+JTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:22:58.028868Z"},"content_sha256":"a225e51c82dff7c4de66a0aa3a21bd7cbb3c892725b2d2e9611f8f3e8c5bceed","schema_version":"1.0","event_id":"sha256:a225e51c82dff7c4de66a0aa3a21bd7cbb3c892725b2d2e9611f8f3e8c5bceed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EIJLSRQPZ3D7KFWBNMGR45XKYS/bundle.json","state_url":"https://pith.science/pith/EIJLSRQPZ3D7KFWBNMGR45XKYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EIJLSRQPZ3D7KFWBNMGR45XKYS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T01:22:58Z","links":{"resolver":"https://pith.science/pith/EIJLSRQPZ3D7KFWBNMGR45XKYS","bundle":"https://pith.science/pith/EIJLSRQPZ3D7KFWBNMGR45XKYS/bundle.json","state":"https://pith.science/pith/EIJLSRQPZ3D7KFWBNMGR45XKYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EIJLSRQPZ3D7KFWBNMGR45XKYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EIJLSRQPZ3D7KFWBNMGR45XKYS","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":"be032426caa8bc577bea28ceadb54cd97e432dfc3637565f7b922095a97b9612","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-18T21:56:36Z","title_canon_sha256":"4b3c376afaeb10b4e48fdca9b53c4beefa908d88054dc383a0f91642093f711e"},"schema_version":"1.0","source":{"id":"1310.5172","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5172","created_at":"2026-05-18T02:39:09Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5172v2","created_at":"2026-05-18T02:39:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5172","created_at":"2026-05-18T02:39:09Z"},{"alias_kind":"pith_short_12","alias_value":"EIJLSRQPZ3D7","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EIJLSRQPZ3D7KFWB","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EIJLSRQP","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:a225e51c82dff7c4de66a0aa3a21bd7cbb3c892725b2d2e9611f8f3e8c5bceed","target":"graph","created_at":"2026-05-18T02:39:09Z","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":"We conjecture that the balanced complete bipartite graph $K_{\\lfloor n/2 \\rfloor,\\lceil n/2 \\rceil}$ contains more cycles than any other $n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent conditions for cycle-maximal triangle-free graphs; show bounds on the numbers of cycles in graphs depending on numbers of vertices and edges, girth, and homomorphisms to small fixed graphs; and use the bounds to show that among regular graphs, the conjecture holds. We also consider graphs that are close to being regular, with the minimum and maximum degrees diffe","authors_text":"David S. Gunderson, Matthew Skala, Pak Ching Li, Stephane Durocher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-18T21:56:36Z","title":"Cycle-maximal triangle-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5172","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:5e4adc4554e090a97a997ab9311d1339fc3400d928feec4f6977f0d329387e96","target":"record","created_at":"2026-05-18T02:39:09Z","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":"be032426caa8bc577bea28ceadb54cd97e432dfc3637565f7b922095a97b9612","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-18T21:56:36Z","title_canon_sha256":"4b3c376afaeb10b4e48fdca9b53c4beefa908d88054dc383a0f91642093f711e"},"schema_version":"1.0","source":{"id":"1310.5172","kind":"arxiv","version":2}},"canonical_sha256":"2212b9460fcec7f516c16b0d1e76eac4b8db336f24fa12b07325376d8e1613ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2212b9460fcec7f516c16b0d1e76eac4b8db336f24fa12b07325376d8e1613ca","first_computed_at":"2026-05-18T02:39:09.031698Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:09.031698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/mvpake7ETwuNT2Jahau8yoqOYIXOvAEQvHeG/flZCowPNJvZZ5ocXfTMSpxr6hBjvyI3aulrPBshwlETW4wBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:09.032205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5172","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e4adc4554e090a97a997ab9311d1339fc3400d928feec4f6977f0d329387e96","sha256:a225e51c82dff7c4de66a0aa3a21bd7cbb3c892725b2d2e9611f8f3e8c5bceed"],"state_sha256":"57e0794da96ab38c080f93000540666504f7d13c6dd2a3de95c27e247f26ca97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Z6sxDFJE3pa6h3wodwHU03isCKDuJMKCp3Oqai7rtpeOM6cqluNZsrXrZIFBtgbgnSO9/oS+bQwakcWvhzbCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:22:58.030929Z","bundle_sha256":"db18268e4c54660c617722977e2687badcf00c23d148867865bbf461e8d47d01"}}