{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MD3XELX5NAXNWX3RVTBPNCRA5H","short_pith_number":"pith:MD3XELX5","schema_version":"1.0","canonical_sha256":"60f7722efd682edb5f71acc2f68a20e9c97b6f42997ec52584175ed9d5a5e5d6","source":{"kind":"arxiv","id":"1807.00570","version":1},"attestation_state":"computed","paper":{"title":"Minimum Labelling bi-Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jose' Andres Moreno Perez, Sergio Consoli","submitted_at":"2018-07-02T09:49:14Z","abstract_excerpt":"A labelled, undirected graph is a graph whose edges have assigned labels, from a specific set. Given a labelled, undirected graph, the well-known minimum labelling spanning tree problem is aimed at finding the spanning tree of the graph with the minimum set of labels. This combinatorial problem, which is NP-hard, can be also formulated as to give the minimum number of labels that provide single connectivity among all the vertices of the graph. Here we consider instead the problem of finding the minimum set of labels that provide bi-connectivity among all the vertices of the graph. A graph is b"},"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":"1807.00570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-02T09:49:14Z","cross_cats_sorted":[],"title_canon_sha256":"f02e2cd968b05d9da09c126de6627e69a93440d7ae2e1a44ccefa79848aa88c1","abstract_canon_sha256":"fe6695e148711697a2d95c67940fd589d7f3f545f4c32e1632a18c59067c06a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:52.154486Z","signature_b64":"V4OV4NB9UISP/HuR/kCfIGZaojO5Gla4uJUreRm/tU0/w3G6G7mFmypupbGSMUFRhKs6qX+p4k/NYQrPwKLMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60f7722efd682edb5f71acc2f68a20e9c97b6f42997ec52584175ed9d5a5e5d6","last_reissued_at":"2026-05-18T00:11:52.153732Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:52.153732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Labelling bi-Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jose' Andres Moreno Perez, Sergio Consoli","submitted_at":"2018-07-02T09:49:14Z","abstract_excerpt":"A labelled, undirected graph is a graph whose edges have assigned labels, from a specific set. Given a labelled, undirected graph, the well-known minimum labelling spanning tree problem is aimed at finding the spanning tree of the graph with the minimum set of labels. This combinatorial problem, which is NP-hard, can be also formulated as to give the minimum number of labels that provide single connectivity among all the vertices of the graph. Here we consider instead the problem of finding the minimum set of labels that provide bi-connectivity among all the vertices of the graph. A graph is b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00570","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":"1807.00570","created_at":"2026-05-18T00:11:52.153863+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.00570v1","created_at":"2026-05-18T00:11:52.153863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00570","created_at":"2026-05-18T00:11:52.153863+00:00"},{"alias_kind":"pith_short_12","alias_value":"MD3XELX5NAXN","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MD3XELX5NAXNWX3R","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MD3XELX5","created_at":"2026-05-18T12:32:37.024351+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/MD3XELX5NAXNWX3RVTBPNCRA5H","json":"https://pith.science/pith/MD3XELX5NAXNWX3RVTBPNCRA5H.json","graph_json":"https://pith.science/api/pith-number/MD3XELX5NAXNWX3RVTBPNCRA5H/graph.json","events_json":"https://pith.science/api/pith-number/MD3XELX5NAXNWX3RVTBPNCRA5H/events.json","paper":"https://pith.science/paper/MD3XELX5"},"agent_actions":{"view_html":"https://pith.science/pith/MD3XELX5NAXNWX3RVTBPNCRA5H","download_json":"https://pith.science/pith/MD3XELX5NAXNWX3RVTBPNCRA5H.json","view_paper":"https://pith.science/paper/MD3XELX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.00570&json=true","fetch_graph":"https://pith.science/api/pith-number/MD3XELX5NAXNWX3RVTBPNCRA5H/graph.json","fetch_events":"https://pith.science/api/pith-number/MD3XELX5NAXNWX3RVTBPNCRA5H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MD3XELX5NAXNWX3RVTBPNCRA5H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MD3XELX5NAXNWX3RVTBPNCRA5H/action/storage_attestation","attest_author":"https://pith.science/pith/MD3XELX5NAXNWX3RVTBPNCRA5H/action/author_attestation","sign_citation":"https://pith.science/pith/MD3XELX5NAXNWX3RVTBPNCRA5H/action/citation_signature","submit_replication":"https://pith.science/pith/MD3XELX5NAXNWX3RVTBPNCRA5H/action/replication_record"}},"created_at":"2026-05-18T00:11:52.153863+00:00","updated_at":"2026-05-18T00:11:52.153863+00:00"}