{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6Z6LRZTYZT4OCZ4VSJ3H3KGTV5","short_pith_number":"pith:6Z6LRZTY","canonical_record":{"source":{"id":"1907.00305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-30T01:58:48Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"64cca6bc2cf5459c93ecf043a52ed2105e0d2ec128bc8f37d2ac3b9c4debafbd","abstract_canon_sha256":"5a23617bfbcf1a89427a43d9901cefa5c823802bdbc20e6e20987be3bd7827f9"},"schema_version":"1.0"},"canonical_sha256":"f67cb8e678ccf8e1679592767da8d3af582e3f17d4fc9b85f57c7b3d4a3b288e","source":{"kind":"arxiv","id":"1907.00305","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00305","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00305v1","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00305","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"6Z6LRZTYZT4O","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6Z6LRZTYZT4OCZ4V","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6Z6LRZTY","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6Z6LRZTYZT4OCZ4VSJ3H3KGTV5","target":"record","payload":{"canonical_record":{"source":{"id":"1907.00305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-30T01:58:48Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"64cca6bc2cf5459c93ecf043a52ed2105e0d2ec128bc8f37d2ac3b9c4debafbd","abstract_canon_sha256":"5a23617bfbcf1a89427a43d9901cefa5c823802bdbc20e6e20987be3bd7827f9"},"schema_version":"1.0"},"canonical_sha256":"f67cb8e678ccf8e1679592767da8d3af582e3f17d4fc9b85f57c7b3d4a3b288e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:52.190568Z","signature_b64":"5tZ853lOMb6t3B3eW11jkzYKyJnsPGyTSQc1k6HWM3EaoltUCg7sK0hNEXzSE7pQOJT9ENsmv4xvFSgGIdW4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f67cb8e678ccf8e1679592767da8d3af582e3f17d4fc9b85f57c7b3d4a3b288e","last_reissued_at":"2026-05-17T23:41:52.189938Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:52.189938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.00305","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-05-17T23:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VvNfWtHfOL/igIfp5wR1DQ3xIjaeNisqMMEoDfx+ibuL8QkMDhF8XiA6jr0wLkEH0iSbtcK8dwMHiPKe1YBEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:55:29.222220Z"},"content_sha256":"37257630571e33a2dee2bce31e2ca5650e073f55259895f8ccc9fe93e0bb34c6","schema_version":"1.0","event_id":"sha256:37257630571e33a2dee2bce31e2ca5650e073f55259895f8ccc9fe93e0bb34c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6Z6LRZTYZT4OCZ4VSJ3H3KGTV5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal bricks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Robin Thomas, Serguei Norine","submitted_at":"2019-06-30T01:58:48Z","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 is minimal if for every edge e the deletion of e results in a graph that is not a brick. We prove a generation theorem for minimal bricks and two corollaries: (1) for n>4, every minimal brick on 2n vertices has at most 5n-7 edges, and (2) every minimal brick has at least three vertices of degree three."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00305","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":""},"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-17T23:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mSGijzYxGn+fe40iBNy2kml2fxjSvLoPwP7TiBJ1PLkKOb5Lzrpv8Y/rvJQqmfMuErwcDpvqyRlcU29Xqyk1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:55:29.222915Z"},"content_sha256":"c24b60d27b6c47033cf2dac481a4a7dbeb6f3465f17aa4cc08168edb94f8052f","schema_version":"1.0","event_id":"sha256:c24b60d27b6c47033cf2dac481a4a7dbeb6f3465f17aa4cc08168edb94f8052f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6Z6LRZTYZT4OCZ4VSJ3H3KGTV5/bundle.json","state_url":"https://pith.science/pith/6Z6LRZTYZT4OCZ4VSJ3H3KGTV5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6Z6LRZTYZT4OCZ4VSJ3H3KGTV5/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-11T15:55:29Z","links":{"resolver":"https://pith.science/pith/6Z6LRZTYZT4OCZ4VSJ3H3KGTV5","bundle":"https://pith.science/pith/6Z6LRZTYZT4OCZ4VSJ3H3KGTV5/bundle.json","state":"https://pith.science/pith/6Z6LRZTYZT4OCZ4VSJ3H3KGTV5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6Z6LRZTYZT4OCZ4VSJ3H3KGTV5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6Z6LRZTYZT4OCZ4VSJ3H3KGTV5","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":"5a23617bfbcf1a89427a43d9901cefa5c823802bdbc20e6e20987be3bd7827f9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-30T01:58:48Z","title_canon_sha256":"64cca6bc2cf5459c93ecf043a52ed2105e0d2ec128bc8f37d2ac3b9c4debafbd"},"schema_version":"1.0","source":{"id":"1907.00305","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00305","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00305v1","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00305","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"6Z6LRZTYZT4O","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6Z6LRZTYZT4OCZ4V","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6Z6LRZTY","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:c24b60d27b6c47033cf2dac481a4a7dbeb6f3465f17aa4cc08168edb94f8052f","target":"graph","created_at":"2026-05-17T23:41:52Z","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":"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 is minimal if for every edge e the deletion of e results in a graph that is not a brick. We prove a generation theorem for minimal bricks and two corollaries: (1) for n>4, every minimal brick on 2n vertices has at most 5n-7 edges, and (2) every minimal brick has at least three vertices of degree three.","authors_text":"Robin Thomas, Serguei Norine","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-30T01:58:48Z","title":"Minimal bricks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00305","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:37257630571e33a2dee2bce31e2ca5650e073f55259895f8ccc9fe93e0bb34c6","target":"record","created_at":"2026-05-17T23:41:52Z","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":"5a23617bfbcf1a89427a43d9901cefa5c823802bdbc20e6e20987be3bd7827f9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-30T01:58:48Z","title_canon_sha256":"64cca6bc2cf5459c93ecf043a52ed2105e0d2ec128bc8f37d2ac3b9c4debafbd"},"schema_version":"1.0","source":{"id":"1907.00305","kind":"arxiv","version":1}},"canonical_sha256":"f67cb8e678ccf8e1679592767da8d3af582e3f17d4fc9b85f57c7b3d4a3b288e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f67cb8e678ccf8e1679592767da8d3af582e3f17d4fc9b85f57c7b3d4a3b288e","first_computed_at":"2026-05-17T23:41:52.189938Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:52.189938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5tZ853lOMb6t3B3eW11jkzYKyJnsPGyTSQc1k6HWM3EaoltUCg7sK0hNEXzSE7pQOJT9ENsmv4xvFSgGIdW4CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:52.190568Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.00305","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37257630571e33a2dee2bce31e2ca5650e073f55259895f8ccc9fe93e0bb34c6","sha256:c24b60d27b6c47033cf2dac481a4a7dbeb6f3465f17aa4cc08168edb94f8052f"],"state_sha256":"7154b1ddb4151001ded83b342ec5cd8a1246a2db3b71b5afb867cf5271f3441b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v5iImsMeXOXH58utGmhdDd4Um/Nt62I0NAzsf2tf+Uc8NnP6h0wackKUKoI7H6y2YA4/L4AzN207rGG+zm52BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T15:55:29.226802Z","bundle_sha256":"46bab7c18cf9452cd7ae571ec1dd6e9345e9cf364a6757a6bceebafd809aa234"}}