{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JCENWOXGRVV6GH4UWZ45Q4VZ7F","short_pith_number":"pith:JCENWOXG","canonical_record":{"source":{"id":"1704.08796","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-28T03:23:33Z","cross_cats_sorted":[],"title_canon_sha256":"27652a928bdd0a58ee7c6be621274b645ce694a5216136425beca7550c30f662","abstract_canon_sha256":"146190698a67d9d3fa347253c34c3541fbf4d51c95ae502bf25191e155555765"},"schema_version":"1.0"},"canonical_sha256":"4888db3ae68d6be31f94b679d872b9f96ff238467297ac3fdf1758562d20650f","source":{"kind":"arxiv","id":"1704.08796","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08796","created_at":"2026-05-22T01:03:13Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08796v4","created_at":"2026-05-22T01:03:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08796","created_at":"2026-05-22T01:03:13Z"},{"alias_kind":"pith_short_12","alias_value":"JCENWOXGRVV6","created_at":"2026-05-22T01:03:13Z"},{"alias_kind":"pith_short_16","alias_value":"JCENWOXGRVV6GH4U","created_at":"2026-05-22T01:03:13Z"},{"alias_kind":"pith_short_8","alias_value":"JCENWOXG","created_at":"2026-05-22T01:03:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JCENWOXGRVV6GH4UWZ45Q4VZ7F","target":"record","payload":{"canonical_record":{"source":{"id":"1704.08796","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-28T03:23:33Z","cross_cats_sorted":[],"title_canon_sha256":"27652a928bdd0a58ee7c6be621274b645ce694a5216136425beca7550c30f662","abstract_canon_sha256":"146190698a67d9d3fa347253c34c3541fbf4d51c95ae502bf25191e155555765"},"schema_version":"1.0"},"canonical_sha256":"4888db3ae68d6be31f94b679d872b9f96ff238467297ac3fdf1758562d20650f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:13.042904Z","signature_b64":"wFQSfWqqPInPAWY7aR8jxVVO47s4X+1E3jwAkLEZiSd0TAZ5Cq0VEv7jfQp2pB8ZRePS0WGbGp4+dLkUTwaSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4888db3ae68d6be31f94b679d872b9f96ff238467297ac3fdf1758562d20650f","last_reissued_at":"2026-05-22T01:03:13.040107Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:13.040107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.08796","source_version":4,"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-22T01:03:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U9a2rLcGz3r2nv9GsNPs/RWQvQyVyDlEpcaaTEbZyFSX+CPnbEQ32ffJLHrGO1+0h9eTCVjN1iK830ZbharxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:51:18.853390Z"},"content_sha256":"f418bdd8c90c31d72217c73b2422b2451de7fefa64a02ded0f9c195c9c764b7e","schema_version":"1.0","event_id":"sha256:f418bdd8c90c31d72217c73b2422b2451de7fefa64a02ded0f9c195c9c764b7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JCENWOXGRVV6GH4UWZ45Q4VZ7F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generating simple near-bipartite bricks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Marcelo H. de Carvalho, Nishad Kothari","submitted_at":"2017-04-28T03:23:33Z","abstract_excerpt":"A brick is a $3$-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick $G$ is near-bipartite if it has a pair of edges $\\alpha$ and $\\beta$ such that $G-\\{\\alpha,\\beta\\}$ is bipartite and matching covered; examples are $K_4$ and the triangular prism $\\overline{C_6}$. The significance of near-bipartite bricks arises from the theory of ear decompositions of matching covered graphs.\n  The object of this paper is to establish a generation procedure which is specific to the class of simple near-bipartite bricks. In particular, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08796","kind":"arxiv","version":4},"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/1704.08796/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-05-22T01:03:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LZSdF1nsZzYZhBGoZXdf7v00vg/fMmeHSysY8IAd9JJKZZjboh6Y9oduhEhUi0F3WICnmCGunDRX299sz1LSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:51:18.853784Z"},"content_sha256":"6f39851f4402cc630bd233c5397c8035620c31fd9951e274c553b93889bfee1e","schema_version":"1.0","event_id":"sha256:6f39851f4402cc630bd233c5397c8035620c31fd9951e274c553b93889bfee1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JCENWOXGRVV6GH4UWZ45Q4VZ7F/bundle.json","state_url":"https://pith.science/pith/JCENWOXGRVV6GH4UWZ45Q4VZ7F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JCENWOXGRVV6GH4UWZ45Q4VZ7F/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-02T19:51:18Z","links":{"resolver":"https://pith.science/pith/JCENWOXGRVV6GH4UWZ45Q4VZ7F","bundle":"https://pith.science/pith/JCENWOXGRVV6GH4UWZ45Q4VZ7F/bundle.json","state":"https://pith.science/pith/JCENWOXGRVV6GH4UWZ45Q4VZ7F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JCENWOXGRVV6GH4UWZ45Q4VZ7F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JCENWOXGRVV6GH4UWZ45Q4VZ7F","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":"146190698a67d9d3fa347253c34c3541fbf4d51c95ae502bf25191e155555765","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-28T03:23:33Z","title_canon_sha256":"27652a928bdd0a58ee7c6be621274b645ce694a5216136425beca7550c30f662"},"schema_version":"1.0","source":{"id":"1704.08796","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08796","created_at":"2026-05-22T01:03:13Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08796v4","created_at":"2026-05-22T01:03:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08796","created_at":"2026-05-22T01:03:13Z"},{"alias_kind":"pith_short_12","alias_value":"JCENWOXGRVV6","created_at":"2026-05-22T01:03:13Z"},{"alias_kind":"pith_short_16","alias_value":"JCENWOXGRVV6GH4U","created_at":"2026-05-22T01:03:13Z"},{"alias_kind":"pith_short_8","alias_value":"JCENWOXG","created_at":"2026-05-22T01:03:13Z"}],"graph_snapshots":[{"event_id":"sha256:6f39851f4402cc630bd233c5397c8035620c31fd9951e274c553b93889bfee1e","target":"graph","created_at":"2026-05-22T01:03:13Z","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/1704.08796/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 such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick $G$ is near-bipartite if it has a pair of edges $\\alpha$ and $\\beta$ such that $G-\\{\\alpha,\\beta\\}$ is bipartite and matching covered; examples are $K_4$ and the triangular prism $\\overline{C_6}$. The significance of near-bipartite bricks arises from the theory of ear decompositions of matching covered graphs.\n  The object of this paper is to establish a generation procedure which is specific to the class of simple near-bipartite bricks. In particular, we ","authors_text":"Marcelo H. de Carvalho, Nishad Kothari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-28T03:23:33Z","title":"Generating simple near-bipartite bricks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08796","kind":"arxiv","version":4},"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:f418bdd8c90c31d72217c73b2422b2451de7fefa64a02ded0f9c195c9c764b7e","target":"record","created_at":"2026-05-22T01:03:13Z","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":"146190698a67d9d3fa347253c34c3541fbf4d51c95ae502bf25191e155555765","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-28T03:23:33Z","title_canon_sha256":"27652a928bdd0a58ee7c6be621274b645ce694a5216136425beca7550c30f662"},"schema_version":"1.0","source":{"id":"1704.08796","kind":"arxiv","version":4}},"canonical_sha256":"4888db3ae68d6be31f94b679d872b9f96ff238467297ac3fdf1758562d20650f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4888db3ae68d6be31f94b679d872b9f96ff238467297ac3fdf1758562d20650f","first_computed_at":"2026-05-22T01:03:13.040107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:03:13.040107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wFQSfWqqPInPAWY7aR8jxVVO47s4X+1E3jwAkLEZiSd0TAZ5Cq0VEv7jfQp2pB8ZRePS0WGbGp4+dLkUTwaSBQ==","signature_status":"signed_v1","signed_at":"2026-05-22T01:03:13.042904Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08796","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f418bdd8c90c31d72217c73b2422b2451de7fefa64a02ded0f9c195c9c764b7e","sha256:6f39851f4402cc630bd233c5397c8035620c31fd9951e274c553b93889bfee1e"],"state_sha256":"5fa66f7963592d34cc55e3faa4436aa663d7a5034f1e06e662f0fdc3bfac9078"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AH76FCW4VJ9xgKhUi8RnG9857bx+riG7geOsGlmjdJs20kHUl0QaQ2c4lfW+7FJ/kTT+LAV9inHkDwM5nLlTBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:51:18.855764Z","bundle_sha256":"405144c2b41e7a6594254e9028038a3bf578e475ca40e9060bc5c6870a34ed32"}}