{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:S67HV3ERDU3UJZENFKJ36KG6BM","short_pith_number":"pith:S67HV3ER","canonical_record":{"source":{"id":"1607.00902","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2016-07-04T14:30:03Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4a922fc6e5cb075c7c549685de9775aab6b0aa450e0bed42389406c2304ecb58","abstract_canon_sha256":"5090337e0a25bd994ceffd61a3a3299c9369f525ea0563fcfed424dce07e0697"},"schema_version":"1.0"},"canonical_sha256":"97be7aec911d3744e48d2a93bf28de0b2c2a3fd9f7ea79ca2f42d2fbc37c3ac0","source":{"kind":"arxiv","id":"1607.00902","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00902","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00902v2","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00902","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"pith_short_12","alias_value":"S67HV3ERDU3U","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"S67HV3ERDU3UJZEN","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"S67HV3ER","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:S67HV3ERDU3UJZENFKJ36KG6BM","target":"record","payload":{"canonical_record":{"source":{"id":"1607.00902","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2016-07-04T14:30:03Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4a922fc6e5cb075c7c549685de9775aab6b0aa450e0bed42389406c2304ecb58","abstract_canon_sha256":"5090337e0a25bd994ceffd61a3a3299c9369f525ea0563fcfed424dce07e0697"},"schema_version":"1.0"},"canonical_sha256":"97be7aec911d3744e48d2a93bf28de0b2c2a3fd9f7ea79ca2f42d2fbc37c3ac0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:00.452526Z","signature_b64":"XXuNEkQLLNtpvfLre4zb7OGMV6NAde4K3JO4zVtMOFCw+p61Cutymqcx7YuIpytOVCpJKnQn7Xn5CCwZ92tIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97be7aec911d3744e48d2a93bf28de0b2c2a3fd9f7ea79ca2f42d2fbc37c3ac0","last_reissued_at":"2026-05-18T00:31:00.451917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:00.451917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.00902","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-18T00:31:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"14TFUzymBhL+guxhppMiMlArdGstt67IysZs1NocqPTqky3LYO/D3LVuXCUr8QjP9B/34pWUXwIzTSGYxhv1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:06:31.854218Z"},"content_sha256":"34fdad555941b74818269570988cb838275af60c1e1a6def60f08ab3569acc07","schema_version":"1.0","event_id":"sha256:34fdad555941b74818269570988cb838275af60c1e1a6def60f08ab3569acc07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:S67HV3ERDU3UJZENFKJ36KG6BM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Hopf algebra for counting simple cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Paul Rochet (LMJL), Pierre-Louis Giscard, Richard Wilson","submitted_at":"2016-07-04T14:30:03Z","abstract_excerpt":"Simple cycles, also known as self-avoiding polygons, are cycles on graphs which are not allowed to visit any vertex more than once. We present an exact formula for enumerating the simple cycles of any length on any directed graph involving a sum over its induced subgraphs. This result stems from an Hopf algebra, which we construct explicitly, and which provides further means of counting simple cycles. Finally, we obtain a more general theorem asserting that any Lie idempotent can be used to enumerate simple cycles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00902","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-18T00:31:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lGEb11R2QWcf50KcucXdej2+cWC/rkDNIxLbnV3l2r8kAm07ww/qSNPUwkOb6FtC2UKWDJW2gfnWk3+BTM58Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:06:31.854585Z"},"content_sha256":"5a1f8c3335105756d525a3b383add2035cf0a0dbec37031b4c056457d81971e4","schema_version":"1.0","event_id":"sha256:5a1f8c3335105756d525a3b383add2035cf0a0dbec37031b4c056457d81971e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S67HV3ERDU3UJZENFKJ36KG6BM/bundle.json","state_url":"https://pith.science/pith/S67HV3ERDU3UJZENFKJ36KG6BM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S67HV3ERDU3UJZENFKJ36KG6BM/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-24T22:06:31Z","links":{"resolver":"https://pith.science/pith/S67HV3ERDU3UJZENFKJ36KG6BM","bundle":"https://pith.science/pith/S67HV3ERDU3UJZENFKJ36KG6BM/bundle.json","state":"https://pith.science/pith/S67HV3ERDU3UJZENFKJ36KG6BM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S67HV3ERDU3UJZENFKJ36KG6BM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:S67HV3ERDU3UJZENFKJ36KG6BM","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":"5090337e0a25bd994ceffd61a3a3299c9369f525ea0563fcfed424dce07e0697","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2016-07-04T14:30:03Z","title_canon_sha256":"4a922fc6e5cb075c7c549685de9775aab6b0aa450e0bed42389406c2304ecb58"},"schema_version":"1.0","source":{"id":"1607.00902","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00902","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00902v2","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00902","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"pith_short_12","alias_value":"S67HV3ERDU3U","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"S67HV3ERDU3UJZEN","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"S67HV3ER","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:5a1f8c3335105756d525a3b383add2035cf0a0dbec37031b4c056457d81971e4","target":"graph","created_at":"2026-05-18T00:31:00Z","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":"Simple cycles, also known as self-avoiding polygons, are cycles on graphs which are not allowed to visit any vertex more than once. We present an exact formula for enumerating the simple cycles of any length on any directed graph involving a sum over its induced subgraphs. This result stems from an Hopf algebra, which we construct explicitly, and which provides further means of counting simple cycles. Finally, we obtain a more general theorem asserting that any Lie idempotent can be used to enumerate simple cycles.","authors_text":"Paul Rochet (LMJL), Pierre-Louis Giscard, Richard Wilson","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2016-07-04T14:30:03Z","title":"An Hopf algebra for counting simple cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00902","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:34fdad555941b74818269570988cb838275af60c1e1a6def60f08ab3569acc07","target":"record","created_at":"2026-05-18T00:31:00Z","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":"5090337e0a25bd994ceffd61a3a3299c9369f525ea0563fcfed424dce07e0697","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2016-07-04T14:30:03Z","title_canon_sha256":"4a922fc6e5cb075c7c549685de9775aab6b0aa450e0bed42389406c2304ecb58"},"schema_version":"1.0","source":{"id":"1607.00902","kind":"arxiv","version":2}},"canonical_sha256":"97be7aec911d3744e48d2a93bf28de0b2c2a3fd9f7ea79ca2f42d2fbc37c3ac0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97be7aec911d3744e48d2a93bf28de0b2c2a3fd9f7ea79ca2f42d2fbc37c3ac0","first_computed_at":"2026-05-18T00:31:00.451917Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:00.451917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XXuNEkQLLNtpvfLre4zb7OGMV6NAde4K3JO4zVtMOFCw+p61Cutymqcx7YuIpytOVCpJKnQn7Xn5CCwZ92tIAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:00.452526Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.00902","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34fdad555941b74818269570988cb838275af60c1e1a6def60f08ab3569acc07","sha256:5a1f8c3335105756d525a3b383add2035cf0a0dbec37031b4c056457d81971e4"],"state_sha256":"2ef9f6fc0589541c6459cadf5bf4dd3147208647bf139770b9c6953244f89358"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p8bcqwPQuWowcvIYMYibWhr+JJ4NAF/+8co7eVdHC5IUA0fA2oTgt7LVUO85x6N4k0ZHoTwg6snKxbOB41b6Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T22:06:31.856633Z","bundle_sha256":"ca4d875a58677ef92be96aa1e53c65c1706ed173ffedf7550950628d6f426875"}}