{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:P64JYWXIAD4NOWL6HCYHF3MJTE","short_pith_number":"pith:P64JYWXI","schema_version":"1.0","canonical_sha256":"7fb89c5ae800f8d7597e38b072ed899910a5f9093a578319dc57130415f26cb9","source":{"kind":"arxiv","id":"1604.04829","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.04829","created_at":"2026-05-18T01:16:56.680174+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.04829v1","created_at":"2026-05-18T01:16:56.680174+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04829","created_at":"2026-05-18T01:16:56.680174+00:00"},{"alias_kind":"pith_short_12","alias_value":"P64JYWXIAD4N","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"P64JYWXIAD4NOWL6","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"P64JYWXI","created_at":"2026-05-18T12:30:36.002864+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P64JYWXIAD4NOWL6HCYHF3MJTE","json":"https://pith.science/pith/P64JYWXIAD4NOWL6HCYHF3MJTE.json","graph_json":"https://pith.science/api/pith-number/P64JYWXIAD4NOWL6HCYHF3MJTE/graph.json","events_json":"https://pith.science/api/pith-number/P64JYWXIAD4NOWL6HCYHF3MJTE/events.json","paper":"https://pith.science/paper/P64JYWXI"},"agent_actions":{"view_html":"https://pith.science/pith/P64JYWXIAD4NOWL6HCYHF3MJTE","download_json":"https://pith.science/pith/P64JYWXIAD4NOWL6HCYHF3MJTE.json","view_paper":"https://pith.science/paper/P64JYWXI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.04829&json=true","fetch_graph":"https://pith.science/api/pith-number/P64JYWXIAD4NOWL6HCYHF3MJTE/graph.json","fetch_events":"https://pith.science/api/pith-number/P64JYWXIAD4NOWL6HCYHF3MJTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P64JYWXIAD4NOWL6HCYHF3MJTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P64JYWXIAD4NOWL6HCYHF3MJTE/action/storage_attestation","attest_author":"https://pith.science/pith/P64JYWXIAD4NOWL6HCYHF3MJTE/action/author_attestation","sign_citation":"https://pith.science/pith/P64JYWXIAD4NOWL6HCYHF3MJTE/action/citation_signature","submit_replication":"https://pith.science/pith/P64JYWXIAD4NOWL6HCYHF3MJTE/action/replication_record"}},"created_at":"2026-05-18T01:16:56.680174+00:00","updated_at":"2026-05-18T01:16:56.680174+00:00"}