{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:P64JYWXIAD4NOWL6HCYHF3MJTE","short_pith_number":"pith:P64JYWXI","canonical_record":{"source":{"id":"1604.04829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-17T05:19:05Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"902b6323f6daab21c1e08a31b8cd3667dd98e7034e15e2164a8e02e946c28cb0","abstract_canon_sha256":"2c9a49c6bd2845b1fd9e22588af45c57f27b1f4b8da2a66fbbaf311d5e696939"},"schema_version":"1.0"},"canonical_sha256":"7fb89c5ae800f8d7597e38b072ed899910a5f9093a578319dc57130415f26cb9","source":{"kind":"arxiv","id":"1604.04829","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04829","created_at":"2026-05-18T01:16:56Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04829v1","created_at":"2026-05-18T01:16:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04829","created_at":"2026-05-18T01:16:56Z"},{"alias_kind":"pith_short_12","alias_value":"P64JYWXIAD4N","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"P64JYWXIAD4NOWL6","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"P64JYWXI","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:P64JYWXIAD4NOWL6HCYHF3MJTE","target":"record","payload":{"canonical_record":{"source":{"id":"1604.04829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-17T05:19:05Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"902b6323f6daab21c1e08a31b8cd3667dd98e7034e15e2164a8e02e946c28cb0","abstract_canon_sha256":"2c9a49c6bd2845b1fd9e22588af45c57f27b1f4b8da2a66fbbaf311d5e696939"},"schema_version":"1.0"},"canonical_sha256":"7fb89c5ae800f8d7597e38b072ed899910a5f9093a578319dc57130415f26cb9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:56.680663Z","signature_b64":"HqKAgJxl5fCMnbDgEmQo1xWeUNUtMUr3/FHQtTZtr4+tm/xr3evGYZ6cdBD6gNYvL1GySHfYAXU8iYUPu+BqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fb89c5ae800f8d7597e38b072ed899910a5f9093a578319dc57130415f26cb9","last_reissued_at":"2026-05-18T01:16:56.680084Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:56.680084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.04829","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-18T01:16:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fubxWLS+155t8X1D5uIxMXj/pt+me1xVkk4whZcNJ+C++BVXrgr9pC1I5zYD/ul9RJfTLMfkxi8u/S9k53B5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:50:11.923000Z"},"content_sha256":"71d569d10ae14c3ce21531da33e207215528d2965891d28546c51f2a0debb470","schema_version":"1.0","event_id":"sha256:71d569d10ae14c3ce21531da33e207215528d2965891d28546c51f2a0debb470"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:P64JYWXIAD4NOWL6HCYHF3MJTE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A heuristic approach for dividing graphs into bi-connected components with a size constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Raka Jovanovic, Stefan Voss, Tatsushi Nishi","submitted_at":"2016-04-17T05:19:05Z","abstract_excerpt":"In this paper we propose a new problem of finding the maximal bi-connected partitioning of a graph with a size constraint (MBCPG-SC). With the goal of finding approximate solutions for the MBCPG-SC, a heuristic method is developed based on the open ear decomposition of graphs. Its essential part is an adaptation of the breadth first search which makes it possible to grow bi-connected subgraphs. The proposed randomized algorithm consists of growing several subgraphs in parallel. The quality of solutions generated in this way is further improved using a local search which exploits neighboring re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04829","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-18T01:16:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u6UwhhqYgdAt//Oet5wT1acZQPeXpD90cEaQeo05w4/UArv2iUkoud38O81aQSu3ruRSPSnm/jHgN9Gzb4zoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:50:11.923638Z"},"content_sha256":"2309f4dea804bba6315c24be574e21aa54460654d403fd732eba8f5eb8e49701","schema_version":"1.0","event_id":"sha256:2309f4dea804bba6315c24be574e21aa54460654d403fd732eba8f5eb8e49701"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P64JYWXIAD4NOWL6HCYHF3MJTE/bundle.json","state_url":"https://pith.science/pith/P64JYWXIAD4NOWL6HCYHF3MJTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P64JYWXIAD4NOWL6HCYHF3MJTE/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-08T01:50:11Z","links":{"resolver":"https://pith.science/pith/P64JYWXIAD4NOWL6HCYHF3MJTE","bundle":"https://pith.science/pith/P64JYWXIAD4NOWL6HCYHF3MJTE/bundle.json","state":"https://pith.science/pith/P64JYWXIAD4NOWL6HCYHF3MJTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P64JYWXIAD4NOWL6HCYHF3MJTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:P64JYWXIAD4NOWL6HCYHF3MJTE","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":"2c9a49c6bd2845b1fd9e22588af45c57f27b1f4b8da2a66fbbaf311d5e696939","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-17T05:19:05Z","title_canon_sha256":"902b6323f6daab21c1e08a31b8cd3667dd98e7034e15e2164a8e02e946c28cb0"},"schema_version":"1.0","source":{"id":"1604.04829","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04829","created_at":"2026-05-18T01:16:56Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04829v1","created_at":"2026-05-18T01:16:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04829","created_at":"2026-05-18T01:16:56Z"},{"alias_kind":"pith_short_12","alias_value":"P64JYWXIAD4N","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"P64JYWXIAD4NOWL6","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"P64JYWXI","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:2309f4dea804bba6315c24be574e21aa54460654d403fd732eba8f5eb8e49701","target":"graph","created_at":"2026-05-18T01:16:56Z","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":"In this paper we propose a new problem of finding the maximal bi-connected partitioning of a graph with a size constraint (MBCPG-SC). With the goal of finding approximate solutions for the MBCPG-SC, a heuristic method is developed based on the open ear decomposition of graphs. Its essential part is an adaptation of the breadth first search which makes it possible to grow bi-connected subgraphs. The proposed randomized algorithm consists of growing several subgraphs in parallel. The quality of solutions generated in this way is further improved using a local search which exploits neighboring re","authors_text":"Raka Jovanovic, Stefan Voss, Tatsushi Nishi","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-17T05:19:05Z","title":"A heuristic approach for dividing graphs into bi-connected components with a size constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04829","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:71d569d10ae14c3ce21531da33e207215528d2965891d28546c51f2a0debb470","target":"record","created_at":"2026-05-18T01:16:56Z","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":"2c9a49c6bd2845b1fd9e22588af45c57f27b1f4b8da2a66fbbaf311d5e696939","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-17T05:19:05Z","title_canon_sha256":"902b6323f6daab21c1e08a31b8cd3667dd98e7034e15e2164a8e02e946c28cb0"},"schema_version":"1.0","source":{"id":"1604.04829","kind":"arxiv","version":1}},"canonical_sha256":"7fb89c5ae800f8d7597e38b072ed899910a5f9093a578319dc57130415f26cb9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fb89c5ae800f8d7597e38b072ed899910a5f9093a578319dc57130415f26cb9","first_computed_at":"2026-05-18T01:16:56.680084Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:56.680084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HqKAgJxl5fCMnbDgEmQo1xWeUNUtMUr3/FHQtTZtr4+tm/xr3evGYZ6cdBD6gNYvL1GySHfYAXU8iYUPu+BqCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:56.680663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04829","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71d569d10ae14c3ce21531da33e207215528d2965891d28546c51f2a0debb470","sha256:2309f4dea804bba6315c24be574e21aa54460654d403fd732eba8f5eb8e49701"],"state_sha256":"5e3918788e5a8dc53d93deb669b441bd3d9e9536672db711c1fbe986b47f7c5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wvT87KppAUASNAMPJgqm4tD6UMC7uzdI2osLSSXixy8blYEKJP0/CWvpIxFwg8DQcd7w9tAnp/VHUDEtepBbBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:50:11.927293Z","bundle_sha256":"b598527830f598d68fa230814a07e9235da87bb6a5b35a98cacb165dcdc46014"}}