{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ML25UR5TGU6LH4HR7GYFELQ5HU","short_pith_number":"pith:ML25UR5T","schema_version":"1.0","canonical_sha256":"62f5da47b3353cb3f0f1f9b0522e1d3d03ca648c7ffcb82229ee8aff9c8885cd","source":{"kind":"arxiv","id":"1001.3163","version":2},"attestation_state":"computed","paper":{"title":"On the decomposition of connected graphs into their biconnected components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Angela Mestre","submitted_at":"2010-01-19T17:20:09Z","abstract_excerpt":"We give a recursion formula to generate all equivalence classes of biconnected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We give a linear map to produce a connected graph with say, u, biconnected components from one with u-1 biconnected components. We use such map to extend the aforesaid result to connected or 2-edge connected graphs. The underlying algorithms are amenable to computer implementation."},"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":"1001.3163","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-01-19T17:20:09Z","cross_cats_sorted":[],"title_canon_sha256":"c6fa9895c248d9e6ab03a58fd9c82ca3fca25f8d9215ecc40ecf08d282be2395","abstract_canon_sha256":"212a8c2227086fb3e696c9e945504348b2018537f9594ab7c5f6cee90518cb61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:07.232923Z","signature_b64":"Bt07e0Y3kQgDuaM5iotmtNvajlY5u+HTkhy5bbz/Al9jXXkZPMgrlhRQMvDSz5j18RkStJkNZxfLgY1QUAVyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62f5da47b3353cb3f0f1f9b0522e1d3d03ca648c7ffcb82229ee8aff9c8885cd","last_reissued_at":"2026-05-18T03:31:07.232442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:07.232442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the decomposition of connected graphs into their biconnected components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Angela Mestre","submitted_at":"2010-01-19T17:20:09Z","abstract_excerpt":"We give a recursion formula to generate all equivalence classes of biconnected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We give a linear map to produce a connected graph with say, u, biconnected components from one with u-1 biconnected components. We use such map to extend the aforesaid result to connected or 2-edge connected graphs. The underlying algorithms are amenable to computer implementation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3163","kind":"arxiv","version":2},"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":"1001.3163","created_at":"2026-05-18T03:31:07.232522+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.3163v2","created_at":"2026-05-18T03:31:07.232522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3163","created_at":"2026-05-18T03:31:07.232522+00:00"},{"alias_kind":"pith_short_12","alias_value":"ML25UR5TGU6L","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"ML25UR5TGU6LH4HR","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"ML25UR5T","created_at":"2026-05-18T12:26:10.704358+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/ML25UR5TGU6LH4HR7GYFELQ5HU","json":"https://pith.science/pith/ML25UR5TGU6LH4HR7GYFELQ5HU.json","graph_json":"https://pith.science/api/pith-number/ML25UR5TGU6LH4HR7GYFELQ5HU/graph.json","events_json":"https://pith.science/api/pith-number/ML25UR5TGU6LH4HR7GYFELQ5HU/events.json","paper":"https://pith.science/paper/ML25UR5T"},"agent_actions":{"view_html":"https://pith.science/pith/ML25UR5TGU6LH4HR7GYFELQ5HU","download_json":"https://pith.science/pith/ML25UR5TGU6LH4HR7GYFELQ5HU.json","view_paper":"https://pith.science/paper/ML25UR5T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.3163&json=true","fetch_graph":"https://pith.science/api/pith-number/ML25UR5TGU6LH4HR7GYFELQ5HU/graph.json","fetch_events":"https://pith.science/api/pith-number/ML25UR5TGU6LH4HR7GYFELQ5HU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ML25UR5TGU6LH4HR7GYFELQ5HU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ML25UR5TGU6LH4HR7GYFELQ5HU/action/storage_attestation","attest_author":"https://pith.science/pith/ML25UR5TGU6LH4HR7GYFELQ5HU/action/author_attestation","sign_citation":"https://pith.science/pith/ML25UR5TGU6LH4HR7GYFELQ5HU/action/citation_signature","submit_replication":"https://pith.science/pith/ML25UR5TGU6LH4HR7GYFELQ5HU/action/replication_record"}},"created_at":"2026-05-18T03:31:07.232522+00:00","updated_at":"2026-05-18T03:31:07.232522+00:00"}