{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6HZ7GD5JMXNNIX32KYMUMRBZU2","short_pith_number":"pith:6HZ7GD5J","canonical_record":{"source":{"id":"1803.03839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-10T17:08:51Z","cross_cats_sorted":[],"title_canon_sha256":"59306caae78b44d460f6dd8711aa77b8b3d81d654f7f52370540fea7d3eecc17","abstract_canon_sha256":"84b815461e17ad4056dd281fee58f8f4ded1bda93fedcb341f47a2588f8f2a24"},"schema_version":"1.0"},"canonical_sha256":"f1f3f30fa965dad45f7a5619464439a69170ba634308a720d83ab64e1521fa30","source":{"kind":"arxiv","id":"1803.03839","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03839","created_at":"2026-05-18T00:11:57Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03839v1","created_at":"2026-05-18T00:11:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03839","created_at":"2026-05-18T00:11:57Z"},{"alias_kind":"pith_short_12","alias_value":"6HZ7GD5JMXNN","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6HZ7GD5JMXNNIX32","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6HZ7GD5J","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6HZ7GD5JMXNNIX32KYMUMRBZU2","target":"record","payload":{"canonical_record":{"source":{"id":"1803.03839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-10T17:08:51Z","cross_cats_sorted":[],"title_canon_sha256":"59306caae78b44d460f6dd8711aa77b8b3d81d654f7f52370540fea7d3eecc17","abstract_canon_sha256":"84b815461e17ad4056dd281fee58f8f4ded1bda93fedcb341f47a2588f8f2a24"},"schema_version":"1.0"},"canonical_sha256":"f1f3f30fa965dad45f7a5619464439a69170ba634308a720d83ab64e1521fa30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:57.195801Z","signature_b64":"ESbOKPMzxuRi+piEZLvf3seleTfiUS3Idkzg9i5Vvtf3IVVWkmU/ehLjZC74Ha/MV4iSrF9D15GamHcAcXV+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1f3f30fa965dad45f7a5619464439a69170ba634308a720d83ab64e1521fa30","last_reissued_at":"2026-05-18T00:11:57.195221Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:57.195221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.03839","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:11:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SJ3Xl8E2To2u1nyo3Smuujqggtg8E5OB3iasE2oi/HF9Giwn0L13XE/0cTxk2UtYvG4EhwEdSKUl1aKWv7xACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:59:30.670958Z"},"content_sha256":"89c530371447474226655c16baab3f1210fea789d6cf08992c93f257bcd112ee","schema_version":"1.0","event_id":"sha256:89c530371447474226655c16baab3f1210fea789d6cf08992c93f257bcd112ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6HZ7GD5JMXNNIX32KYMUMRBZU2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Enumeration of Bipartite Subgraphs in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kunihiro Wasa, Takeaki Uno","submitted_at":"2018-03-10T17:08:51Z","abstract_excerpt":"Subgraph enumeration problems ask to output all subgraphs of an input graph that belongs to the specified graph class or satisfy the given constraint. These problems have been widely studied in theoretical computer science. As far, many efficient enumeration algorithms for the fundamental substructures such as spanning trees, cycles, and paths, have been developed. This paper addresses the enumeration problem of bipartite subgraphs. Even though bipartite graphs are quite fundamental and have numerous applications in both theory and application, its enumeration algorithms have not been intensiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03839","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:11:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PynQG0Hydm2g9QG8KZXTun/gIZ3Wk1lrg1CJk/JH3EP7BYrt2Mga1Q7PkOZCW4ztY6SNDYWw2ceCE95NCL2pAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:59:30.671601Z"},"content_sha256":"3d244ce3febbdebb2fa1dc73b9967a62f5988ca74378471f6ad1f41d19edd029","schema_version":"1.0","event_id":"sha256:3d244ce3febbdebb2fa1dc73b9967a62f5988ca74378471f6ad1f41d19edd029"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6HZ7GD5JMXNNIX32KYMUMRBZU2/bundle.json","state_url":"https://pith.science/pith/6HZ7GD5JMXNNIX32KYMUMRBZU2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6HZ7GD5JMXNNIX32KYMUMRBZU2/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-28T21:59:30Z","links":{"resolver":"https://pith.science/pith/6HZ7GD5JMXNNIX32KYMUMRBZU2","bundle":"https://pith.science/pith/6HZ7GD5JMXNNIX32KYMUMRBZU2/bundle.json","state":"https://pith.science/pith/6HZ7GD5JMXNNIX32KYMUMRBZU2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6HZ7GD5JMXNNIX32KYMUMRBZU2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6HZ7GD5JMXNNIX32KYMUMRBZU2","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":"84b815461e17ad4056dd281fee58f8f4ded1bda93fedcb341f47a2588f8f2a24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-10T17:08:51Z","title_canon_sha256":"59306caae78b44d460f6dd8711aa77b8b3d81d654f7f52370540fea7d3eecc17"},"schema_version":"1.0","source":{"id":"1803.03839","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03839","created_at":"2026-05-18T00:11:57Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03839v1","created_at":"2026-05-18T00:11:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03839","created_at":"2026-05-18T00:11:57Z"},{"alias_kind":"pith_short_12","alias_value":"6HZ7GD5JMXNN","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6HZ7GD5JMXNNIX32","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6HZ7GD5J","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:3d244ce3febbdebb2fa1dc73b9967a62f5988ca74378471f6ad1f41d19edd029","target":"graph","created_at":"2026-05-18T00:11:57Z","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":"Subgraph enumeration problems ask to output all subgraphs of an input graph that belongs to the specified graph class or satisfy the given constraint. These problems have been widely studied in theoretical computer science. As far, many efficient enumeration algorithms for the fundamental substructures such as spanning trees, cycles, and paths, have been developed. This paper addresses the enumeration problem of bipartite subgraphs. Even though bipartite graphs are quite fundamental and have numerous applications in both theory and application, its enumeration algorithms have not been intensiv","authors_text":"Kunihiro Wasa, Takeaki Uno","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-10T17:08:51Z","title":"Efficient Enumeration of Bipartite Subgraphs in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03839","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:89c530371447474226655c16baab3f1210fea789d6cf08992c93f257bcd112ee","target":"record","created_at":"2026-05-18T00:11:57Z","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":"84b815461e17ad4056dd281fee58f8f4ded1bda93fedcb341f47a2588f8f2a24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-10T17:08:51Z","title_canon_sha256":"59306caae78b44d460f6dd8711aa77b8b3d81d654f7f52370540fea7d3eecc17"},"schema_version":"1.0","source":{"id":"1803.03839","kind":"arxiv","version":1}},"canonical_sha256":"f1f3f30fa965dad45f7a5619464439a69170ba634308a720d83ab64e1521fa30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1f3f30fa965dad45f7a5619464439a69170ba634308a720d83ab64e1521fa30","first_computed_at":"2026-05-18T00:11:57.195221Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:57.195221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ESbOKPMzxuRi+piEZLvf3seleTfiUS3Idkzg9i5Vvtf3IVVWkmU/ehLjZC74Ha/MV4iSrF9D15GamHcAcXV+Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:57.195801Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03839","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89c530371447474226655c16baab3f1210fea789d6cf08992c93f257bcd112ee","sha256:3d244ce3febbdebb2fa1dc73b9967a62f5988ca74378471f6ad1f41d19edd029"],"state_sha256":"c6a14c3e3848e6e8c83feafd7b27ad54e74dedd9b1d177a418f9ad45c0cd53e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UU7W9nyGaEbn4ZE1QzBF70FHNki7QnqHtP0SC9c0hKrhlXMeX7ZWt5BeyyXMKxf6zs9NyihG523JGaGaGBXgBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:59:30.674671Z","bundle_sha256":"81bd0ed13179e001fb55dd88842197dfd099657c9812e5f91c039a69c693c9fe"}}