{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JHKSB4YV6PHYGOC6WTK2X5KZAW","short_pith_number":"pith:JHKSB4YV","canonical_record":{"source":{"id":"1805.00840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-02T14:20:04Z","cross_cats_sorted":[],"title_canon_sha256":"e01c8632713926ddf91cc7e55989be09e8c37ea42fc8a83a99797a31c105f905","abstract_canon_sha256":"935abfe8d0e107b7b06d322a39ae2c133eb71c57a4e5151ca849d7118490907f"},"schema_version":"1.0"},"canonical_sha256":"49d520f315f3cf83385eb4d5abf5590588f5343b6d652fdb4a9a4c41c8a2f813","source":{"kind":"arxiv","id":"1805.00840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00840","created_at":"2026-05-18T00:16:57Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00840v1","created_at":"2026-05-18T00:16:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00840","created_at":"2026-05-18T00:16:57Z"},{"alias_kind":"pith_short_12","alias_value":"JHKSB4YV6PHY","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JHKSB4YV6PHYGOC6","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JHKSB4YV","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JHKSB4YV6PHYGOC6WTK2X5KZAW","target":"record","payload":{"canonical_record":{"source":{"id":"1805.00840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-02T14:20:04Z","cross_cats_sorted":[],"title_canon_sha256":"e01c8632713926ddf91cc7e55989be09e8c37ea42fc8a83a99797a31c105f905","abstract_canon_sha256":"935abfe8d0e107b7b06d322a39ae2c133eb71c57a4e5151ca849d7118490907f"},"schema_version":"1.0"},"canonical_sha256":"49d520f315f3cf83385eb4d5abf5590588f5343b6d652fdb4a9a4c41c8a2f813","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:57.539179Z","signature_b64":"svXADwFcs+G0ghdPVA1ZhLwcNzavLopBYSgcIQhIVxH3TTYJhiFqPFXKBJPSBdWMkvEvhdGfqgOkffvyMcaOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49d520f315f3cf83385eb4d5abf5590588f5343b6d652fdb4a9a4c41c8a2f813","last_reissued_at":"2026-05-18T00:16:57.538422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:57.538422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.00840","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-18T00:16:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bw0pteO6Bz8oW2WDZeWFQmz3S13Q+4AYky5wUppdTI3Ne+Uzxo80YKdz1ErGtVQmz+ZOHzHg45raL4tphBb3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:43:03.449412Z"},"content_sha256":"4af32f101212ad9fdd69003675a0f61faaface1120ecf49d845e84b328c17e36","schema_version":"1.0","event_id":"sha256:4af32f101212ad9fdd69003675a0f61faaface1120ecf49d845e84b328c17e36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JHKSB4YV6PHYGOC6WTK2X5KZAW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uniquely restricted matchings in subcubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Maximilian F\\\"urst, Michael A. Henning","submitted_at":"2018-05-02T14:20:04Z","abstract_excerpt":"A matching $M$ in a graph $G$ is uniquely restricted if no other matching in $G$ covers the same set of vertices. We conjecture that every connected subcubic graph with $m$ edges and $b$ bridges that is distinct from $K_{3,3}$ has a uniquely restricted matching of size at least $\\frac{m+b}{6}$, and we establish this bound with $b$ replaced by the number of bridges that lie on a path between two vertices of degree at most $2$. Moreover, we prove that every connected subcubic graph of order $n$ and girth at least $7$ has a uniquely restricted matching of size at least $\\frac{n-1}{3}$, which part"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00840","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-18T00:16:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ro4R/dzrcEyJlPKxDEvi+DthXCzLk2yMO6ZraRx8opxgxf5zfSJF4fFJzAOAcMratZcITB2Q6OX5/zMCKExhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:43:03.450059Z"},"content_sha256":"61afa8c910d3fb790bc3a34e1231625dc08c59e957b8f7b227a8b124f7a2e8f1","schema_version":"1.0","event_id":"sha256:61afa8c910d3fb790bc3a34e1231625dc08c59e957b8f7b227a8b124f7a2e8f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JHKSB4YV6PHYGOC6WTK2X5KZAW/bundle.json","state_url":"https://pith.science/pith/JHKSB4YV6PHYGOC6WTK2X5KZAW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JHKSB4YV6PHYGOC6WTK2X5KZAW/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-11T02:43:03Z","links":{"resolver":"https://pith.science/pith/JHKSB4YV6PHYGOC6WTK2X5KZAW","bundle":"https://pith.science/pith/JHKSB4YV6PHYGOC6WTK2X5KZAW/bundle.json","state":"https://pith.science/pith/JHKSB4YV6PHYGOC6WTK2X5KZAW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JHKSB4YV6PHYGOC6WTK2X5KZAW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JHKSB4YV6PHYGOC6WTK2X5KZAW","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":"935abfe8d0e107b7b06d322a39ae2c133eb71c57a4e5151ca849d7118490907f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-02T14:20:04Z","title_canon_sha256":"e01c8632713926ddf91cc7e55989be09e8c37ea42fc8a83a99797a31c105f905"},"schema_version":"1.0","source":{"id":"1805.00840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00840","created_at":"2026-05-18T00:16:57Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00840v1","created_at":"2026-05-18T00:16:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00840","created_at":"2026-05-18T00:16:57Z"},{"alias_kind":"pith_short_12","alias_value":"JHKSB4YV6PHY","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JHKSB4YV6PHYGOC6","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JHKSB4YV","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:61afa8c910d3fb790bc3a34e1231625dc08c59e957b8f7b227a8b124f7a2e8f1","target":"graph","created_at":"2026-05-18T00:16:57Z","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 matching $M$ in a graph $G$ is uniquely restricted if no other matching in $G$ covers the same set of vertices. We conjecture that every connected subcubic graph with $m$ edges and $b$ bridges that is distinct from $K_{3,3}$ has a uniquely restricted matching of size at least $\\frac{m+b}{6}$, and we establish this bound with $b$ replaced by the number of bridges that lie on a path between two vertices of degree at most $2$. Moreover, we prove that every connected subcubic graph of order $n$ and girth at least $7$ has a uniquely restricted matching of size at least $\\frac{n-1}{3}$, which part","authors_text":"Dieter Rautenbach, Maximilian F\\\"urst, Michael A. Henning","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-02T14:20:04Z","title":"Uniquely restricted matchings in subcubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00840","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:4af32f101212ad9fdd69003675a0f61faaface1120ecf49d845e84b328c17e36","target":"record","created_at":"2026-05-18T00:16:57Z","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":"935abfe8d0e107b7b06d322a39ae2c133eb71c57a4e5151ca849d7118490907f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-02T14:20:04Z","title_canon_sha256":"e01c8632713926ddf91cc7e55989be09e8c37ea42fc8a83a99797a31c105f905"},"schema_version":"1.0","source":{"id":"1805.00840","kind":"arxiv","version":1}},"canonical_sha256":"49d520f315f3cf83385eb4d5abf5590588f5343b6d652fdb4a9a4c41c8a2f813","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49d520f315f3cf83385eb4d5abf5590588f5343b6d652fdb4a9a4c41c8a2f813","first_computed_at":"2026-05-18T00:16:57.538422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:57.538422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"svXADwFcs+G0ghdPVA1ZhLwcNzavLopBYSgcIQhIVxH3TTYJhiFqPFXKBJPSBdWMkvEvhdGfqgOkffvyMcaOCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:57.539179Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.00840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4af32f101212ad9fdd69003675a0f61faaface1120ecf49d845e84b328c17e36","sha256:61afa8c910d3fb790bc3a34e1231625dc08c59e957b8f7b227a8b124f7a2e8f1"],"state_sha256":"ca8e7063d16986fec28641f3265a877ee431ee15390b42d622bf2190c3ac97ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3NpIs42Ud0n8LKaJoH5eehNNVrC8ge9Sy2i5qy46LDECCRA7gtQRrckQhT1cv+Za6VVlDo1JVj8co41gSiJGCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:43:03.453625Z","bundle_sha256":"f0b5db376fe975320c6ec48021bf44b4480a4e6d16a893f3d65c518db4c3854f"}}