{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LKCJNQEPSUOEVQVVSQOWENQO3N","short_pith_number":"pith:LKCJNQEP","canonical_record":{"source":{"id":"1611.07899","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-23T17:35:28Z","cross_cats_sorted":[],"title_canon_sha256":"9654548b4d6debc97a268f39c32cf3aeb7601927218238a10fa2f94eba822cc8","abstract_canon_sha256":"8222e2d71dfe3e0517b29f71638ef711bda91d49438698eb94ef529149abc51b"},"schema_version":"1.0"},"canonical_sha256":"5a8496c08f951c4ac2b5941d62360edb6676c3144ac32822554ccc4bf9f9c7fc","source":{"kind":"arxiv","id":"1611.07899","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07899","created_at":"2026-05-18T00:08:23Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07899v2","created_at":"2026-05-18T00:08:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07899","created_at":"2026-05-18T00:08:23Z"},{"alias_kind":"pith_short_12","alias_value":"LKCJNQEPSUOE","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LKCJNQEPSUOEVQVV","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LKCJNQEP","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LKCJNQEPSUOEVQVVSQOWENQO3N","target":"record","payload":{"canonical_record":{"source":{"id":"1611.07899","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-23T17:35:28Z","cross_cats_sorted":[],"title_canon_sha256":"9654548b4d6debc97a268f39c32cf3aeb7601927218238a10fa2f94eba822cc8","abstract_canon_sha256":"8222e2d71dfe3e0517b29f71638ef711bda91d49438698eb94ef529149abc51b"},"schema_version":"1.0"},"canonical_sha256":"5a8496c08f951c4ac2b5941d62360edb6676c3144ac32822554ccc4bf9f9c7fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:23.903917Z","signature_b64":"9EW+rYjvCrVgGm5hpwcJj3SZuAjm/OtCjhrLtvk+AI999/pfEwjnG4xhrG2QK6DASCZ5sDhGGAYs07y+2LN6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a8496c08f951c4ac2b5941d62360edb6676c3144ac32822554ccc4bf9f9c7fc","last_reissued_at":"2026-05-18T00:08:23.903306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:23.903306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.07899","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-18T00:08:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KdJGhvOhZDbPuEvz3T7dmAauGMQ887KDQ6QOVdpxQ6F4URpOqSSWnaR6VHZ6z6QNiimBdUn0YS9E/POoD/vZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:31:51.718959Z"},"content_sha256":"7ae331746618bbb59cab13d4b52478bc219e5706000bacbdaa674f23a07dd2ee","schema_version":"1.0","event_id":"sha256:7ae331746618bbb59cab13d4b52478bc219e5706000bacbdaa674f23a07dd2ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LKCJNQEPSUOEVQVVSQOWENQO3N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generating Near-Bipartite Bricks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nishad Kothari","submitted_at":"2016-11-23T17:35:28Z","abstract_excerpt":"A $3$-connected graph $G$ is a brick if, for any two vertices $u$ and $v$, the graph $G-\\{u,v\\}$ has a perfect matching. Deleting an edge $e$ from a brick $G$ results in a graph with zero, one or two vertices of degree two. The bicontraction of a vertex of degree two consists of contracting the two edges incident with it; and the retract of $G-e$ is the graph $J$ obtained from it by bicontracting all its vertices of degree two. An edge $e$ is thin if $J$ is also a brick. Carvalho, Lucchesi and Murty [How to build a brick, Discrete Mathematics 306 (2006), 2383-2410] showed that every brick, dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07899","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-18T00:08:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XJyACdIddwyQs0EIUoo3GdGoJUzTNhjQ252wTI11FkEq1YmZmxXpYsxukI+qSXYWbKngrUcamr/a1Oz7IN2tDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:31:51.719304Z"},"content_sha256":"76b347d2a4133579613eac67316521fc861b2370fc5a75cea07c809973fafb32","schema_version":"1.0","event_id":"sha256:76b347d2a4133579613eac67316521fc861b2370fc5a75cea07c809973fafb32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LKCJNQEPSUOEVQVVSQOWENQO3N/bundle.json","state_url":"https://pith.science/pith/LKCJNQEPSUOEVQVVSQOWENQO3N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LKCJNQEPSUOEVQVVSQOWENQO3N/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-03T00:31:51Z","links":{"resolver":"https://pith.science/pith/LKCJNQEPSUOEVQVVSQOWENQO3N","bundle":"https://pith.science/pith/LKCJNQEPSUOEVQVVSQOWENQO3N/bundle.json","state":"https://pith.science/pith/LKCJNQEPSUOEVQVVSQOWENQO3N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LKCJNQEPSUOEVQVVSQOWENQO3N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LKCJNQEPSUOEVQVVSQOWENQO3N","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":"8222e2d71dfe3e0517b29f71638ef711bda91d49438698eb94ef529149abc51b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-23T17:35:28Z","title_canon_sha256":"9654548b4d6debc97a268f39c32cf3aeb7601927218238a10fa2f94eba822cc8"},"schema_version":"1.0","source":{"id":"1611.07899","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07899","created_at":"2026-05-18T00:08:23Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07899v2","created_at":"2026-05-18T00:08:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07899","created_at":"2026-05-18T00:08:23Z"},{"alias_kind":"pith_short_12","alias_value":"LKCJNQEPSUOE","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LKCJNQEPSUOEVQVV","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LKCJNQEP","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:76b347d2a4133579613eac67316521fc861b2370fc5a75cea07c809973fafb32","target":"graph","created_at":"2026-05-18T00:08:23Z","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 $3$-connected graph $G$ is a brick if, for any two vertices $u$ and $v$, the graph $G-\\{u,v\\}$ has a perfect matching. Deleting an edge $e$ from a brick $G$ results in a graph with zero, one or two vertices of degree two. The bicontraction of a vertex of degree two consists of contracting the two edges incident with it; and the retract of $G-e$ is the graph $J$ obtained from it by bicontracting all its vertices of degree two. An edge $e$ is thin if $J$ is also a brick. Carvalho, Lucchesi and Murty [How to build a brick, Discrete Mathematics 306 (2006), 2383-2410] showed that every brick, dis","authors_text":"Nishad Kothari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-23T17:35:28Z","title":"Generating Near-Bipartite Bricks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07899","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:7ae331746618bbb59cab13d4b52478bc219e5706000bacbdaa674f23a07dd2ee","target":"record","created_at":"2026-05-18T00:08:23Z","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":"8222e2d71dfe3e0517b29f71638ef711bda91d49438698eb94ef529149abc51b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-23T17:35:28Z","title_canon_sha256":"9654548b4d6debc97a268f39c32cf3aeb7601927218238a10fa2f94eba822cc8"},"schema_version":"1.0","source":{"id":"1611.07899","kind":"arxiv","version":2}},"canonical_sha256":"5a8496c08f951c4ac2b5941d62360edb6676c3144ac32822554ccc4bf9f9c7fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a8496c08f951c4ac2b5941d62360edb6676c3144ac32822554ccc4bf9f9c7fc","first_computed_at":"2026-05-18T00:08:23.903306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:23.903306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9EW+rYjvCrVgGm5hpwcJj3SZuAjm/OtCjhrLtvk+AI999/pfEwjnG4xhrG2QK6DASCZ5sDhGGAYs07y+2LN6BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:23.903917Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07899","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ae331746618bbb59cab13d4b52478bc219e5706000bacbdaa674f23a07dd2ee","sha256:76b347d2a4133579613eac67316521fc861b2370fc5a75cea07c809973fafb32"],"state_sha256":"4e561c7689f773d0c2e1877da1a1a2a682af3345f8698ab4a208fad3c94fe0cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h792iqE3a5UUpqsMP+yLnJ8m1P5+1MJN8LV8fjur8Bl1tP1/vgfIVMkqFu2kCs+9MydSTpGRBdPZIw9j7DriAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:31:51.721432Z","bundle_sha256":"40f532f420c4c28268da76d415c436e3e85dd6c10e11d942f033d4908eceb147"}}