{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:A4AUD2IHDD3OCLNFK75GVPDNK5","short_pith_number":"pith:A4AUD2IH","canonical_record":{"source":{"id":"1806.04307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-12T02:53:18Z","cross_cats_sorted":[],"title_canon_sha256":"4a1f7b435054f078c6549272ea8edd7cbba21326e2ef668f6e4df2090e85a9c3","abstract_canon_sha256":"88f28e8f63fe21664e0fed7977333c51397f2708db68d1049c29b62aaba00283"},"schema_version":"1.0"},"canonical_sha256":"070141e90718f6e12da557fa6abc6d57500cb0638b65b7f77e552911e9be7a86","source":{"kind":"arxiv","id":"1806.04307","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04307","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04307v1","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04307","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"pith_short_12","alias_value":"A4AUD2IHDD3O","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A4AUD2IHDD3OCLNF","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A4AUD2IH","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:A4AUD2IHDD3OCLNFK75GVPDNK5","target":"record","payload":{"canonical_record":{"source":{"id":"1806.04307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-12T02:53:18Z","cross_cats_sorted":[],"title_canon_sha256":"4a1f7b435054f078c6549272ea8edd7cbba21326e2ef668f6e4df2090e85a9c3","abstract_canon_sha256":"88f28e8f63fe21664e0fed7977333c51397f2708db68d1049c29b62aaba00283"},"schema_version":"1.0"},"canonical_sha256":"070141e90718f6e12da557fa6abc6d57500cb0638b65b7f77e552911e9be7a86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:19.166553Z","signature_b64":"Xg47ntgBmJDroCnyigpKSVn+fteFnQhuimYWfwL+kqGQEds6tpH7evf+GlUrRk+z6VdFaePpLAf43MVVrdHnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"070141e90718f6e12da557fa6abc6d57500cb0638b65b7f77e552911e9be7a86","last_reissued_at":"2026-05-18T00:05:19.165854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:19.165854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.04307","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-05-18T00:05:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SpMVhqe5Rq0wzTvb5/TGFHh1vvmuMAaOlE6UZwqQ4HdC8TbvV+Zi/vhfi58Dj36Qu6BCyedZkvH86PPcox0wCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:50:06.494336Z"},"content_sha256":"24ead2839597d4e423d70d73a0c2a98f8a3ffc2da9f383134f4361824cf813ff","schema_version":"1.0","event_id":"sha256:24ead2839597d4e423d70d73a0c2a98f8a3ffc2da9f383134f4361824cf813ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:A4AUD2IHDD3OCLNFK75GVPDNK5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alessio Conte, Hiroki Arimura, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno","submitted_at":"2018-06-12T02:53:18Z","abstract_excerpt":"The girth of a graph is the length of its shortest cycle. Due to its relevance in graph theory, network analysis and practical fields such as distributed computing, girth-related problems have been object of attention in both past and recent literature. In this paper, we consider the problem of listing connected subgraphs with bounded girth. As a large girth is index of sparsity, this allows to extract sparse structures from the input graph. We propose two algorithms, for enumerating respectively vertex induced subgraphs and edge induced subgraphs with bounded girth, both running in $O(n)$ amo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04307","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":""},"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:05:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oes1uWfqcW7xGLw8JlAXFZLVnsg1nXUn9IUlcqrFoJ8r/36oDVQuUzFs9L/e3B1OnQRzpiBNN7mlC/Fq0by5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:50:06.495030Z"},"content_sha256":"d3905001962d7ea8f366bb0dfaa4efde50cf0beb015ef1f0e5b502367930bb23","schema_version":"1.0","event_id":"sha256:d3905001962d7ea8f366bb0dfaa4efde50cf0beb015ef1f0e5b502367930bb23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4AUD2IHDD3OCLNFK75GVPDNK5/bundle.json","state_url":"https://pith.science/pith/A4AUD2IHDD3OCLNFK75GVPDNK5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4AUD2IHDD3OCLNFK75GVPDNK5/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-05-27T16:50:06Z","links":{"resolver":"https://pith.science/pith/A4AUD2IHDD3OCLNFK75GVPDNK5","bundle":"https://pith.science/pith/A4AUD2IHDD3OCLNFK75GVPDNK5/bundle.json","state":"https://pith.science/pith/A4AUD2IHDD3OCLNFK75GVPDNK5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4AUD2IHDD3OCLNFK75GVPDNK5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:A4AUD2IHDD3OCLNFK75GVPDNK5","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":"88f28e8f63fe21664e0fed7977333c51397f2708db68d1049c29b62aaba00283","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-12T02:53:18Z","title_canon_sha256":"4a1f7b435054f078c6549272ea8edd7cbba21326e2ef668f6e4df2090e85a9c3"},"schema_version":"1.0","source":{"id":"1806.04307","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04307","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04307v1","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04307","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"pith_short_12","alias_value":"A4AUD2IHDD3O","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A4AUD2IHDD3OCLNF","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A4AUD2IH","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:d3905001962d7ea8f366bb0dfaa4efde50cf0beb015ef1f0e5b502367930bb23","target":"graph","created_at":"2026-05-18T00:05:19Z","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":"The girth of a graph is the length of its shortest cycle. Due to its relevance in graph theory, network analysis and practical fields such as distributed computing, girth-related problems have been object of attention in both past and recent literature. In this paper, we consider the problem of listing connected subgraphs with bounded girth. As a large girth is index of sparsity, this allows to extract sparse structures from the input graph. We propose two algorithms, for enumerating respectively vertex induced subgraphs and edge induced subgraphs with bounded girth, both running in $O(n)$ amo","authors_text":"Alessio Conte, Hiroki Arimura, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-12T02:53:18Z","title":"Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04307","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:24ead2839597d4e423d70d73a0c2a98f8a3ffc2da9f383134f4361824cf813ff","target":"record","created_at":"2026-05-18T00:05:19Z","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":"88f28e8f63fe21664e0fed7977333c51397f2708db68d1049c29b62aaba00283","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-12T02:53:18Z","title_canon_sha256":"4a1f7b435054f078c6549272ea8edd7cbba21326e2ef668f6e4df2090e85a9c3"},"schema_version":"1.0","source":{"id":"1806.04307","kind":"arxiv","version":1}},"canonical_sha256":"070141e90718f6e12da557fa6abc6d57500cb0638b65b7f77e552911e9be7a86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"070141e90718f6e12da557fa6abc6d57500cb0638b65b7f77e552911e9be7a86","first_computed_at":"2026-05-18T00:05:19.165854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:19.165854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xg47ntgBmJDroCnyigpKSVn+fteFnQhuimYWfwL+kqGQEds6tpH7evf+GlUrRk+z6VdFaePpLAf43MVVrdHnDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:19.166553Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.04307","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24ead2839597d4e423d70d73a0c2a98f8a3ffc2da9f383134f4361824cf813ff","sha256:d3905001962d7ea8f366bb0dfaa4efde50cf0beb015ef1f0e5b502367930bb23"],"state_sha256":"41997bc9b366546f4b84d56d932f3be0fc708be17a8d2cd023cc17d994c9cf10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L5Nb/1pUTdrZulWnWwQymUZv3cYfF5kKkwts/J5kqN6CAQQU9u1C4taMYDRuvmVnLIC2TmP3RrzEBfGM7AaoAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:50:06.498542Z","bundle_sha256":"57fb446d24c7d53092b18eda9e7a628a80b1a7f69c0416f3592a9d6c5bf8983f"}}