{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7MTO4WPGYBZIVFIG3I76Z5P2SN","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":"e5430cf06fdc652e084092b2859ab15c19b2cb30a1b8b7ace831154b6cfd7ba2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-28T14:39:42Z","title_canon_sha256":"f93de2d930e6db90dc135e2126e57fe9835ff7968dbd0891aa64184931e4e997"},"schema_version":"1.0","source":{"id":"1907.12091","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.12091","created_at":"2026-07-04T23:50:05Z"},{"alias_kind":"arxiv_version","alias_value":"1907.12091v1","created_at":"2026-07-04T23:50:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.12091","created_at":"2026-07-04T23:50:05Z"},{"alias_kind":"pith_short_12","alias_value":"7MTO4WPGYBZI","created_at":"2026-07-04T23:50:05Z"},{"alias_kind":"pith_short_16","alias_value":"7MTO4WPGYBZIVFIG","created_at":"2026-07-04T23:50:05Z"},{"alias_kind":"pith_short_8","alias_value":"7MTO4WPG","created_at":"2026-07-04T23:50:05Z"}],"graph_snapshots":[{"event_id":"sha256:652a9ca64caacdaf12dd755ef30bcfd25facae956a7014937d6a019edb9333c1","target":"graph","created_at":"2026-07-04T23:50:05Z","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/1907.12091/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give an upper bound on the number of cycles in a simple graph in terms of its degree sequence, and apply this bound to resolve several conjectures of Kir\\'aly and Arman and Tsaturian and to improve upper bounds on the maximum number of cycles in a planar graph.","authors_text":"Jonathan A. Noel, Luke Postle, Natasha Morrison, Sergey Norin, Zden\\v{e}k Dvo\\v{r}\\'ak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-28T14:39:42Z","title":"Bounding the number of cycles in a graph in terms of its degree sequence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.12091","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:0d8499d4e7152142e35284ff97943af68983b888704505fbb23ef526f713fddc","target":"record","created_at":"2026-07-04T23:50:05Z","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":"e5430cf06fdc652e084092b2859ab15c19b2cb30a1b8b7ace831154b6cfd7ba2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-28T14:39:42Z","title_canon_sha256":"f93de2d930e6db90dc135e2126e57fe9835ff7968dbd0891aa64184931e4e997"},"schema_version":"1.0","source":{"id":"1907.12091","kind":"arxiv","version":1}},"canonical_sha256":"fb26ee59e6c0728a9506da3fecf5fa9365974755cc979798d5f6412bda4d7dd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb26ee59e6c0728a9506da3fecf5fa9365974755cc979798d5f6412bda4d7dd4","first_computed_at":"2026-07-04T23:50:05.324579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:50:05.324579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hFq/uAeaj8nESxagF6pTXnfizL8dBnbA/cPvgWT4YtqAIhHCO91GTsrvr1Tvk+fI4OwAhSKdorla9ykwG2n2Ag==","signature_status":"signed_v1","signed_at":"2026-07-04T23:50:05.324965Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.12091","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d8499d4e7152142e35284ff97943af68983b888704505fbb23ef526f713fddc","sha256:652a9ca64caacdaf12dd755ef30bcfd25facae956a7014937d6a019edb9333c1"],"state_sha256":"088a5dd1fceacbfee13aafd7930d0d7d018c16862fbdc946f7f8c6506e6bb636"}