{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:4F6AJWQV5YAMKIGMS7PLKPPYXT","short_pith_number":"pith:4F6AJWQV","schema_version":"1.0","canonical_sha256":"e17c04da15ee00c520cc97deb53df8bcdb0df25b9f27da2ca24d142fb21bef4e","source":{"kind":"arxiv","id":"0808.1138","version":2},"attestation_state":"computed","paper":{"title":"A Complete Grammar for Decomposing a Family of Graphs into 3-connected Components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.CO","authors_text":"Bilyana Shoilekova, Eric Fusy, Guillaume Chapuy, Mihyun Kang","submitted_at":"2008-08-07T23:37:55Z","abstract_excerpt":"Tutte has described in the book \"Connectivity in graphs\" a canonical decomposition of any graph into 3-connected components. In this article we translate (using the language of symbolic combinatorics)\n  Tutte's decomposition into a general grammar expressing any family of graphs (with some stability conditions) in terms of the 3-connected subfamily. A key ingredient we use is an extension of the so-called dissymmetry theorem, which yields negative signs in the grammar.\n  As a main application we recover in a purely combinatorial way the analytic expression found by Gim\\'enez and Noy for the se"},"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":"0808.1138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-08-07T23:37:55Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"764f1369a6f75465374d85aab554937706545e572d1e12cb9e225add2e391f59","abstract_canon_sha256":"375ca2b4b7352d3e82c30d7354f98e509e09155baa6a63901e93c8795715e06d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:39.142556Z","signature_b64":"lprVyB8e/kjJ90dEeh7yl7QmBHHqjokb7bpLYyMf6QLDMGfh3o+cK65fGOpo77CP4ywEjEJ4kI0aInLODfSfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e17c04da15ee00c520cc97deb53df8bcdb0df25b9f27da2ca24d142fb21bef4e","last_reissued_at":"2026-05-18T03:57:39.141784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:39.141784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Complete Grammar for Decomposing a Family of Graphs into 3-connected Components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.CO","authors_text":"Bilyana Shoilekova, Eric Fusy, Guillaume Chapuy, Mihyun Kang","submitted_at":"2008-08-07T23:37:55Z","abstract_excerpt":"Tutte has described in the book \"Connectivity in graphs\" a canonical decomposition of any graph into 3-connected components. In this article we translate (using the language of symbolic combinatorics)\n  Tutte's decomposition into a general grammar expressing any family of graphs (with some stability conditions) in terms of the 3-connected subfamily. A key ingredient we use is an extension of the so-called dissymmetry theorem, which yields negative signs in the grammar.\n  As a main application we recover in a purely combinatorial way the analytic expression found by Gim\\'enez and Noy for the se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.1138","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":"0808.1138","created_at":"2026-05-18T03:57:39.141902+00:00"},{"alias_kind":"arxiv_version","alias_value":"0808.1138v2","created_at":"2026-05-18T03:57:39.141902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.1138","created_at":"2026-05-18T03:57:39.141902+00:00"},{"alias_kind":"pith_short_12","alias_value":"4F6AJWQV5YAM","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"4F6AJWQV5YAMKIGM","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"4F6AJWQV","created_at":"2026-05-18T12:25:56.245647+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/4F6AJWQV5YAMKIGMS7PLKPPYXT","json":"https://pith.science/pith/4F6AJWQV5YAMKIGMS7PLKPPYXT.json","graph_json":"https://pith.science/api/pith-number/4F6AJWQV5YAMKIGMS7PLKPPYXT/graph.json","events_json":"https://pith.science/api/pith-number/4F6AJWQV5YAMKIGMS7PLKPPYXT/events.json","paper":"https://pith.science/paper/4F6AJWQV"},"agent_actions":{"view_html":"https://pith.science/pith/4F6AJWQV5YAMKIGMS7PLKPPYXT","download_json":"https://pith.science/pith/4F6AJWQV5YAMKIGMS7PLKPPYXT.json","view_paper":"https://pith.science/paper/4F6AJWQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0808.1138&json=true","fetch_graph":"https://pith.science/api/pith-number/4F6AJWQV5YAMKIGMS7PLKPPYXT/graph.json","fetch_events":"https://pith.science/api/pith-number/4F6AJWQV5YAMKIGMS7PLKPPYXT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4F6AJWQV5YAMKIGMS7PLKPPYXT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4F6AJWQV5YAMKIGMS7PLKPPYXT/action/storage_attestation","attest_author":"https://pith.science/pith/4F6AJWQV5YAMKIGMS7PLKPPYXT/action/author_attestation","sign_citation":"https://pith.science/pith/4F6AJWQV5YAMKIGMS7PLKPPYXT/action/citation_signature","submit_replication":"https://pith.science/pith/4F6AJWQV5YAMKIGMS7PLKPPYXT/action/replication_record"}},"created_at":"2026-05-18T03:57:39.141902+00:00","updated_at":"2026-05-18T03:57:39.141902+00:00"}