{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:POO7EH5CBYO4SANWUACWTETW3Q","short_pith_number":"pith:POO7EH5C","canonical_record":{"source":{"id":"2608.12832","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-13T05:10:49Z","cross_cats_sorted":[],"title_canon_sha256":"90d4460d55adb7bd712a94c15baf20a4b3ebd9cd1ef2ed795c56ab477ec54af1","abstract_canon_sha256":"32cc06ad8f8944b77ed7575850c14446aaab1de9e2413c9e260960b84216b42d"},"schema_version":"1.0"},"canonical_sha256":"7b9df21fa20e1dc901b6a005699276dc3f9db274e5c5f0dbf78ed8961a2da10c","source":{"kind":"arxiv","id":"2608.12832","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.12832","created_at":"2026-08-14T00:48:54Z"},{"alias_kind":"arxiv_version","alias_value":"2608.12832v1","created_at":"2026-08-14T00:48:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.12832","created_at":"2026-08-14T00:48:54Z"},{"alias_kind":"pith_short_12","alias_value":"POO7EH5CBYO4","created_at":"2026-08-14T00:48:54Z"},{"alias_kind":"pith_short_16","alias_value":"POO7EH5CBYO4SANW","created_at":"2026-08-14T00:48:54Z"},{"alias_kind":"pith_short_8","alias_value":"POO7EH5C","created_at":"2026-08-14T00:48:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:POO7EH5CBYO4SANWUACWTETW3Q","target":"record","payload":{"canonical_record":{"source":{"id":"2608.12832","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-13T05:10:49Z","cross_cats_sorted":[],"title_canon_sha256":"90d4460d55adb7bd712a94c15baf20a4b3ebd9cd1ef2ed795c56ab477ec54af1","abstract_canon_sha256":"32cc06ad8f8944b77ed7575850c14446aaab1de9e2413c9e260960b84216b42d"},"schema_version":"1.0"},"canonical_sha256":"7b9df21fa20e1dc901b6a005699276dc3f9db274e5c5f0dbf78ed8961a2da10c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-14T00:48:54.914076Z","signature_b64":"EU4mcdeOU8L+x0lf8xDGo6lLEvtiKAJ2IJ5nvRv8aXvB5Qv8O1tUJ0BEgwxTHbzzH/skDNMOdE9/7yim76COCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b9df21fa20e1dc901b6a005699276dc3f9db274e5c5f0dbf78ed8961a2da10c","last_reissued_at":"2026-08-14T00:48:54.911021Z","signature_status":"signed_v1","first_computed_at":"2026-08-14T00:48:54.911021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.12832","source_version":1,"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-08-14T00:48:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lZnZDJzauB821o/dgq87G4qwV1fzflaMIHOTw8nJxxUv0Vgv+Poyl7C0yhE+Y8eT7+c6NZXMBQXbLyKUcNdRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T06:49:01.763523Z"},"content_sha256":"a376f1b7f27bd9d2bf3e0304d877432933ec7cb74383b7d950db727756383f88","schema_version":"1.0","event_id":"sha256:a376f1b7f27bd9d2bf3e0304d877432933ec7cb74383b7d950db727756383f88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:POO7EH5CBYO4SANWUACWTETW3Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bricks that every removable edge is solitary","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fuliang Lu, Jinxin Xue, Jun Ge, Yaxian Zhang","submitted_at":"2026-08-13T05:10:49Z","abstract_excerpt":"A brick is a 3-connected graph $G$ such that $G-u-v$ has a perfect matching for any two distinct vertices $u,v\\in V(G)$. An edge $e$ in a matching covered graph $G$ is removable if $G-e$ is matching covered. We say that a removable edge $e$ in a brick $G$ is $b$-invariant if $b(G-e)=b(G)=1$, where $b(H)$ denotes the number of bricks in the tight cut decomposition of a matching covered graph $H$. An edge of a graph is solitary if it lies in precisely one perfect matching.\n  Lucchesi and Murty proposed the problem of characterizing bricks, distinct from $K_4$, $\\overline{C_6}$ and the Petersen g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.12832","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.12832/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-08-14T00:48:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nq2Hris5kv2KHDX2Z9Q8kXRUdC03eMhzJXY2knLU8l2GPvKWk1/99XssSbADLCl23lCwqfcsKdrcjhfnCy+jCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T06:49:01.764083Z"},"content_sha256":"7ed9b63ae0bc4fea162dfd89c0d241db86c72a724701af37e7775ad9f0963ed3","schema_version":"1.0","event_id":"sha256:7ed9b63ae0bc4fea162dfd89c0d241db86c72a724701af37e7775ad9f0963ed3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/POO7EH5CBYO4SANWUACWTETW3Q/bundle.json","state_url":"https://pith.science/pith/POO7EH5CBYO4SANWUACWTETW3Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/POO7EH5CBYO4SANWUACWTETW3Q/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-08-20T06:49:01Z","links":{"resolver":"https://pith.science/pith/POO7EH5CBYO4SANWUACWTETW3Q","bundle":"https://pith.science/pith/POO7EH5CBYO4SANWUACWTETW3Q/bundle.json","state":"https://pith.science/pith/POO7EH5CBYO4SANWUACWTETW3Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/POO7EH5CBYO4SANWUACWTETW3Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:POO7EH5CBYO4SANWUACWTETW3Q","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":"32cc06ad8f8944b77ed7575850c14446aaab1de9e2413c9e260960b84216b42d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-13T05:10:49Z","title_canon_sha256":"90d4460d55adb7bd712a94c15baf20a4b3ebd9cd1ef2ed795c56ab477ec54af1"},"schema_version":"1.0","source":{"id":"2608.12832","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.12832","created_at":"2026-08-14T00:48:54Z"},{"alias_kind":"arxiv_version","alias_value":"2608.12832v1","created_at":"2026-08-14T00:48:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.12832","created_at":"2026-08-14T00:48:54Z"},{"alias_kind":"pith_short_12","alias_value":"POO7EH5CBYO4","created_at":"2026-08-14T00:48:54Z"},{"alias_kind":"pith_short_16","alias_value":"POO7EH5CBYO4SANW","created_at":"2026-08-14T00:48:54Z"},{"alias_kind":"pith_short_8","alias_value":"POO7EH5C","created_at":"2026-08-14T00:48:54Z"}],"graph_snapshots":[{"event_id":"sha256:7ed9b63ae0bc4fea162dfd89c0d241db86c72a724701af37e7775ad9f0963ed3","target":"graph","created_at":"2026-08-14T00:48:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.12832/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A brick is a 3-connected graph $G$ such that $G-u-v$ has a perfect matching for any two distinct vertices $u,v\\in V(G)$. An edge $e$ in a matching covered graph $G$ is removable if $G-e$ is matching covered. We say that a removable edge $e$ in a brick $G$ is $b$-invariant if $b(G-e)=b(G)=1$, where $b(H)$ denotes the number of bricks in the tight cut decomposition of a matching covered graph $H$. An edge of a graph is solitary if it lies in precisely one perfect matching.\n  Lucchesi and Murty proposed the problem of characterizing bricks, distinct from $K_4$, $\\overline{C_6}$ and the Petersen g","authors_text":"Fuliang Lu, Jinxin Xue, Jun Ge, Yaxian Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-13T05:10:49Z","title":"Bricks that every removable edge is solitary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.12832","kind":"arxiv","version":1},"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:a376f1b7f27bd9d2bf3e0304d877432933ec7cb74383b7d950db727756383f88","target":"record","created_at":"2026-08-14T00:48:54Z","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":"32cc06ad8f8944b77ed7575850c14446aaab1de9e2413c9e260960b84216b42d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-13T05:10:49Z","title_canon_sha256":"90d4460d55adb7bd712a94c15baf20a4b3ebd9cd1ef2ed795c56ab477ec54af1"},"schema_version":"1.0","source":{"id":"2608.12832","kind":"arxiv","version":1}},"canonical_sha256":"7b9df21fa20e1dc901b6a005699276dc3f9db274e5c5f0dbf78ed8961a2da10c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b9df21fa20e1dc901b6a005699276dc3f9db274e5c5f0dbf78ed8961a2da10c","first_computed_at":"2026-08-14T00:48:54.911021Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-14T00:48:54.911021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EU4mcdeOU8L+x0lf8xDGo6lLEvtiKAJ2IJ5nvRv8aXvB5Qv8O1tUJ0BEgwxTHbzzH/skDNMOdE9/7yim76COCA==","signature_status":"signed_v1","signed_at":"2026-08-14T00:48:54.914076Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.12832","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a376f1b7f27bd9d2bf3e0304d877432933ec7cb74383b7d950db727756383f88","sha256:7ed9b63ae0bc4fea162dfd89c0d241db86c72a724701af37e7775ad9f0963ed3"],"state_sha256":"140badfa39d8eeb087c6d30283b1812fcc8c3240426d41ddfa542f1b257f7433"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wfBdNxSgjnJ+R3gpMc54+eWpHU4vyX8ph/4hi3cNF8tVrQ5rl8J9DaJ5y2mqpQOWd5H4n2Hk8nMrPtZRa65BAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T06:49:01.767882Z","bundle_sha256":"ce2a381b5cdd9c01978aa0e1ad988bddbc7b98aef076c809ce392e516aa4b057"}}