{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:4F6AJWQV5YAMKIGMS7PLKPPYXT","short_pith_number":"pith:4F6AJWQV","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"},"canonical_sha256":"e17c04da15ee00c520cc97deb53df8bcdb0df25b9f27da2ca24d142fb21bef4e","source":{"kind":"arxiv","id":"0808.1138","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.1138","created_at":"2026-05-18T03:57:39Z"},{"alias_kind":"arxiv_version","alias_value":"0808.1138v2","created_at":"2026-05-18T03:57:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.1138","created_at":"2026-05-18T03:57:39Z"},{"alias_kind":"pith_short_12","alias_value":"4F6AJWQV5YAM","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"4F6AJWQV5YAMKIGM","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"4F6AJWQV","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:4F6AJWQV5YAMKIGMS7PLKPPYXT","target":"record","payload":{"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"},"canonical_sha256":"e17c04da15ee00c520cc97deb53df8bcdb0df25b9f27da2ca24d142fb21bef4e","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"},"source_kind":"arxiv","source_id":"0808.1138","source_version":2,"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-18T03:57:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GN8Y5ANVzkm+NAtgBgiOU22Of8/IAJO0Jbhd65IaOgF6pXblUvSCLzcKo/4cXHalsjK1oXIW9Px3wLsLQ3SOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:27:31.348810Z"},"content_sha256":"7263792b75c61145f322e544862b8f051c948e9a718f6e3a783c829f80596c2a","schema_version":"1.0","event_id":"sha256:7263792b75c61145f322e544862b8f051c948e9a718f6e3a783c829f80596c2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:4F6AJWQV5YAMKIGMS7PLKPPYXT","target":"graph","payload":{"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"},"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-18T03:57:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ngXmWtj/GilFthgBAffUQbq78eteXY502ahZVjZbfbc8DGyJavLJ6ZfhasCnJMoM8E7lWjAc0059cW+G0qgmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:27:31.349201Z"},"content_sha256":"d8a5f850b85923e05574c5fcd10eaa2fbd99571e36c99085151fa02aca55deed","schema_version":"1.0","event_id":"sha256:d8a5f850b85923e05574c5fcd10eaa2fbd99571e36c99085151fa02aca55deed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4F6AJWQV5YAMKIGMS7PLKPPYXT/bundle.json","state_url":"https://pith.science/pith/4F6AJWQV5YAMKIGMS7PLKPPYXT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4F6AJWQV5YAMKIGMS7PLKPPYXT/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-01T01:27:31Z","links":{"resolver":"https://pith.science/pith/4F6AJWQV5YAMKIGMS7PLKPPYXT","bundle":"https://pith.science/pith/4F6AJWQV5YAMKIGMS7PLKPPYXT/bundle.json","state":"https://pith.science/pith/4F6AJWQV5YAMKIGMS7PLKPPYXT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4F6AJWQV5YAMKIGMS7PLKPPYXT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:4F6AJWQV5YAMKIGMS7PLKPPYXT","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":"375ca2b4b7352d3e82c30d7354f98e509e09155baa6a63901e93c8795715e06d","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-08-07T23:37:55Z","title_canon_sha256":"764f1369a6f75465374d85aab554937706545e572d1e12cb9e225add2e391f59"},"schema_version":"1.0","source":{"id":"0808.1138","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.1138","created_at":"2026-05-18T03:57:39Z"},{"alias_kind":"arxiv_version","alias_value":"0808.1138v2","created_at":"2026-05-18T03:57:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.1138","created_at":"2026-05-18T03:57:39Z"},{"alias_kind":"pith_short_12","alias_value":"4F6AJWQV5YAM","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"4F6AJWQV5YAMKIGM","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"4F6AJWQV","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:d8a5f850b85923e05574c5fcd10eaa2fbd99571e36c99085151fa02aca55deed","target":"graph","created_at":"2026-05-18T03:57:39Z","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":"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","authors_text":"Bilyana Shoilekova, Eric Fusy, Guillaume Chapuy, Mihyun Kang","cross_cats":["math.AC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-08-07T23:37:55Z","title":"A Complete Grammar for Decomposing a Family of Graphs into 3-connected Components"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.1138","kind":"arxiv","version":2},"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:7263792b75c61145f322e544862b8f051c948e9a718f6e3a783c829f80596c2a","target":"record","created_at":"2026-05-18T03:57:39Z","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":"375ca2b4b7352d3e82c30d7354f98e509e09155baa6a63901e93c8795715e06d","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-08-07T23:37:55Z","title_canon_sha256":"764f1369a6f75465374d85aab554937706545e572d1e12cb9e225add2e391f59"},"schema_version":"1.0","source":{"id":"0808.1138","kind":"arxiv","version":2}},"canonical_sha256":"e17c04da15ee00c520cc97deb53df8bcdb0df25b9f27da2ca24d142fb21bef4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e17c04da15ee00c520cc97deb53df8bcdb0df25b9f27da2ca24d142fb21bef4e","first_computed_at":"2026-05-18T03:57:39.141784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:39.141784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lprVyB8e/kjJ90dEeh7yl7QmBHHqjokb7bpLYyMf6QLDMGfh3o+cK65fGOpo77CP4ywEjEJ4kI0aInLODfSfDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:39.142556Z","signed_message":"canonical_sha256_bytes"},"source_id":"0808.1138","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7263792b75c61145f322e544862b8f051c948e9a718f6e3a783c829f80596c2a","sha256:d8a5f850b85923e05574c5fcd10eaa2fbd99571e36c99085151fa02aca55deed"],"state_sha256":"39f488084a94d00f72b78124c37edbf3b5cbceedaee1d9590df8cf3fb8b5cc65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dqEpmcF7e6ps9+H8Jjv89vF6FMMQsm1Rpgq+y30aLD6m/8s0qgh2mChKJ23HeAcSRH/x9td3xvGwCR4t7c9cBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:27:31.352557Z","bundle_sha256":"00aa45c470b37ca35bf134661015bb9e079c2a7d73bf885b06a454f80c48ae42"}}