{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:WEFPHJBLRHWVDNXRD2Q3IA432U","short_pith_number":"pith:WEFPHJBL","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"},"canonical_sha256":"b10af3a42b89ed51b6f11ea1b4039bd51d9638f0872c968f6d5094410b87432d","source":{"kind":"arxiv","id":"2410.11183","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.11183","created_at":"2026-07-05T09:20:30Z"},{"alias_kind":"arxiv_version","alias_value":"2410.11183v1","created_at":"2026-07-05T09:20:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.11183","created_at":"2026-07-05T09:20:30Z"},{"alias_kind":"pith_short_12","alias_value":"WEFPHJBLRHWV","created_at":"2026-07-05T09:20:30Z"},{"alias_kind":"pith_short_16","alias_value":"WEFPHJBLRHWVDNXR","created_at":"2026-07-05T09:20:30Z"},{"alias_kind":"pith_short_8","alias_value":"WEFPHJBL","created_at":"2026-07-05T09:20:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:WEFPHJBLRHWVDNXRD2Q3IA432U","target":"record","payload":{"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"},"canonical_sha256":"b10af3a42b89ed51b6f11ea1b4039bd51d9638f0872c968f6d5094410b87432d","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"},"source_kind":"arxiv","source_id":"2410.11183","source_version":1,"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-07-05T09:20:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fTs90TTq5rahaMA1PBRYItf6/9VglPLZAJ+f+f6DAFcq5KiAv0hKq4YmC9xAr2yKzAxqcAVUZB4m5y5bepHIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:58:18.099293Z"},"content_sha256":"19cfa81900882973630eb7a5c1910f68cb798f1e160bbd28d03538de3acaf2bc","schema_version":"1.0","event_id":"sha256:19cfa81900882973630eb7a5c1910f68cb798f1e160bbd28d03538de3acaf2bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:WEFPHJBLRHWVDNXRD2Q3IA432U","target":"graph","payload":{"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"},"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-07-05T09:20:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LdmWpFAuSDkM6Uk3x2UzTUORxDeXlXSUkZ8P3EEiW8MXZLx5CQ0FuDjxW/UYBezI4QD8beXqfQgYQODjGRYGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:58:18.099815Z"},"content_sha256":"607a1b18a84edac3d567697c16fbf2c7819140fd4bbd54d4a09aae09d4309cfe","schema_version":"1.0","event_id":"sha256:607a1b18a84edac3d567697c16fbf2c7819140fd4bbd54d4a09aae09d4309cfe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WEFPHJBLRHWVDNXRD2Q3IA432U/bundle.json","state_url":"https://pith.science/pith/WEFPHJBLRHWVDNXRD2Q3IA432U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WEFPHJBLRHWVDNXRD2Q3IA432U/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-08-06T01:58:18Z","links":{"resolver":"https://pith.science/pith/WEFPHJBLRHWVDNXRD2Q3IA432U","bundle":"https://pith.science/pith/WEFPHJBLRHWVDNXRD2Q3IA432U/bundle.json","state":"https://pith.science/pith/WEFPHJBLRHWVDNXRD2Q3IA432U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WEFPHJBLRHWVDNXRD2Q3IA432U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WEFPHJBLRHWVDNXRD2Q3IA432U","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":"6fc38ff76cc524813c25aca594cb206ee70507e08835feaa40beb2b0d2120b2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-15T02:01:31Z","title_canon_sha256":"aa54d5e3752f3d89a951665d8638c17ef3d408a78eb68edae42084fed1583167"},"schema_version":"1.0","source":{"id":"2410.11183","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.11183","created_at":"2026-07-05T09:20:30Z"},{"alias_kind":"arxiv_version","alias_value":"2410.11183v1","created_at":"2026-07-05T09:20:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.11183","created_at":"2026-07-05T09:20:30Z"},{"alias_kind":"pith_short_12","alias_value":"WEFPHJBLRHWV","created_at":"2026-07-05T09:20:30Z"},{"alias_kind":"pith_short_16","alias_value":"WEFPHJBLRHWVDNXR","created_at":"2026-07-05T09:20:30Z"},{"alias_kind":"pith_short_8","alias_value":"WEFPHJBL","created_at":"2026-07-05T09:20:30Z"}],"graph_snapshots":[{"event_id":"sha256:607a1b18a84edac3d567697c16fbf2c7819140fd4bbd54d4a09aae09d4309cfe","target":"graph","created_at":"2026-07-05T09:20:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2410.11183/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Chengli Li, Feng Liu, Xingzhi Zhan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-15T02:01:31Z","title":"The minimum size and maximum diameter of an edge-pancyclic graph of a given order"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.11183","kind":"arxiv","version":1},"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:19cfa81900882973630eb7a5c1910f68cb798f1e160bbd28d03538de3acaf2bc","target":"record","created_at":"2026-07-05T09:20:30Z","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":"6fc38ff76cc524813c25aca594cb206ee70507e08835feaa40beb2b0d2120b2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-15T02:01:31Z","title_canon_sha256":"aa54d5e3752f3d89a951665d8638c17ef3d408a78eb68edae42084fed1583167"},"schema_version":"1.0","source":{"id":"2410.11183","kind":"arxiv","version":1}},"canonical_sha256":"b10af3a42b89ed51b6f11ea1b4039bd51d9638f0872c968f6d5094410b87432d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b10af3a42b89ed51b6f11ea1b4039bd51d9638f0872c968f6d5094410b87432d","first_computed_at":"2026-07-05T09:20:30.455744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:20:30.455744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LriFu052g0um5guTR+CCt0HzStwGQCyNRtN6Hi+N2MkscFbaeKFsSNLp1V/FP8oefihlxEZhYFLAhIzQsC8ZCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:20:30.456199Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.11183","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19cfa81900882973630eb7a5c1910f68cb798f1e160bbd28d03538de3acaf2bc","sha256:607a1b18a84edac3d567697c16fbf2c7819140fd4bbd54d4a09aae09d4309cfe"],"state_sha256":"81bed9eee779f20114afe9149fa15a61dbcbb95d528f12fe8a0bca40f7dab628"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XNQa0WhJxV+YX1/e78fJ7asY0YqSD7WYeSGOTe/nYPT7+reo0aUH2kB/GzTevfEkIra/dKegETqZZUyhmPDjDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T01:58:18.105819Z","bundle_sha256":"73aa8f36d80479287bf72ac9c0131215590523d6f384322cd315b9eb89785b37"}}