{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WEFPHJBLRHWVDNXRD2Q3IA432U","short_pith_number":"pith:WEFPHJBL","schema_version":"1.0","canonical_sha256":"b10af3a42b89ed51b6f11ea1b4039bd51d9638f0872c968f6d5094410b87432d","source":{"kind":"arxiv","id":"2410.11183","version":1},"attestation_state":"computed","paper":{"title":"The minimum size and maximum diameter of an edge-pancyclic graph of a given order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chengli Li, Feng Liu, Xingzhi Zhan","submitted_at":"2024-10-15T02:01:31Z","abstract_excerpt":"A $k$-cycle in a graph is a cycle of length $k.$ A graph $G$ of order $n$ is called edge-pancyclic if for every integer $k$ with $3\\le k\\le n,$ every edge of $G$ lies in a $k$-cycle. It seems difficult to determine the minimum size $f(n)$ of a simple edge-pancyclic graph of order $n.$ We give lower and upper bounds on $f(n),$ and determine the maximum diameter of such a graph. In the $3$-connected case, the precise value of $f(n)$ is determined. We also determine the minimum size of a graph of a given order with connectivity conditions in which every edge lies in a triangle."},"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":"2410.11183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-15T02:01:31Z","cross_cats_sorted":[],"title_canon_sha256":"aa54d5e3752f3d89a951665d8638c17ef3d408a78eb68edae42084fed1583167","abstract_canon_sha256":"6fc38ff76cc524813c25aca594cb206ee70507e08835feaa40beb2b0d2120b2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:20:30.456199Z","signature_b64":"LriFu052g0um5guTR+CCt0HzStwGQCyNRtN6Hi+N2MkscFbaeKFsSNLp1V/FP8oefihlxEZhYFLAhIzQsC8ZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b10af3a42b89ed51b6f11ea1b4039bd51d9638f0872c968f6d5094410b87432d","last_reissued_at":"2026-07-05T09:20:30.455744Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:20:30.455744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The minimum size and maximum diameter of an edge-pancyclic graph of a given order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chengli Li, Feng Liu, Xingzhi Zhan","submitted_at":"2024-10-15T02:01:31Z","abstract_excerpt":"A $k$-cycle in a graph is a cycle of length $k.$ A graph $G$ of order $n$ is called edge-pancyclic if for every integer $k$ with $3\\le k\\le n,$ every edge of $G$ lies in a $k$-cycle. It seems difficult to determine the minimum size $f(n)$ of a simple edge-pancyclic graph of order $n.$ We give lower and upper bounds on $f(n),$ and determine the maximum diameter of such a graph. In the $3$-connected case, the precise value of $f(n)$ is determined. We also determine the minimum size of a graph of a given order with connectivity conditions in which every edge lies in a triangle."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.11183","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.11183/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2410.11183","created_at":"2026-07-05T09:20:30.455811+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.11183v1","created_at":"2026-07-05T09:20:30.455811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.11183","created_at":"2026-07-05T09:20:30.455811+00:00"},{"alias_kind":"pith_short_12","alias_value":"WEFPHJBLRHWV","created_at":"2026-07-05T09:20:30.455811+00:00"},{"alias_kind":"pith_short_16","alias_value":"WEFPHJBLRHWVDNXR","created_at":"2026-07-05T09:20:30.455811+00:00"},{"alias_kind":"pith_short_8","alias_value":"WEFPHJBL","created_at":"2026-07-05T09:20:30.455811+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/WEFPHJBLRHWVDNXRD2Q3IA432U","json":"https://pith.science/pith/WEFPHJBLRHWVDNXRD2Q3IA432U.json","graph_json":"https://pith.science/api/pith-number/WEFPHJBLRHWVDNXRD2Q3IA432U/graph.json","events_json":"https://pith.science/api/pith-number/WEFPHJBLRHWVDNXRD2Q3IA432U/events.json","paper":"https://pith.science/paper/WEFPHJBL"},"agent_actions":{"view_html":"https://pith.science/pith/WEFPHJBLRHWVDNXRD2Q3IA432U","download_json":"https://pith.science/pith/WEFPHJBLRHWVDNXRD2Q3IA432U.json","view_paper":"https://pith.science/paper/WEFPHJBL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.11183&json=true","fetch_graph":"https://pith.science/api/pith-number/WEFPHJBLRHWVDNXRD2Q3IA432U/graph.json","fetch_events":"https://pith.science/api/pith-number/WEFPHJBLRHWVDNXRD2Q3IA432U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WEFPHJBLRHWVDNXRD2Q3IA432U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WEFPHJBLRHWVDNXRD2Q3IA432U/action/storage_attestation","attest_author":"https://pith.science/pith/WEFPHJBLRHWVDNXRD2Q3IA432U/action/author_attestation","sign_citation":"https://pith.science/pith/WEFPHJBLRHWVDNXRD2Q3IA432U/action/citation_signature","submit_replication":"https://pith.science/pith/WEFPHJBLRHWVDNXRD2Q3IA432U/action/replication_record"}},"created_at":"2026-07-05T09:20:30.455811+00:00","updated_at":"2026-07-05T09:20:30.455811+00:00"}