{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JHKSB4YV6PHYGOC6WTK2X5KZAW","short_pith_number":"pith:JHKSB4YV","schema_version":"1.0","canonical_sha256":"49d520f315f3cf83385eb4d5abf5590588f5343b6d652fdb4a9a4c41c8a2f813","source":{"kind":"arxiv","id":"1805.00840","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.00840","created_at":"2026-05-18T00:16:57.538542+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.00840v1","created_at":"2026-05-18T00:16:57.538542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00840","created_at":"2026-05-18T00:16:57.538542+00:00"},{"alias_kind":"pith_short_12","alias_value":"JHKSB4YV6PHY","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JHKSB4YV6PHYGOC6","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JHKSB4YV","created_at":"2026-05-18T12:32:31.084164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JHKSB4YV6PHYGOC6WTK2X5KZAW","json":"https://pith.science/pith/JHKSB4YV6PHYGOC6WTK2X5KZAW.json","graph_json":"https://pith.science/api/pith-number/JHKSB4YV6PHYGOC6WTK2X5KZAW/graph.json","events_json":"https://pith.science/api/pith-number/JHKSB4YV6PHYGOC6WTK2X5KZAW/events.json","paper":"https://pith.science/paper/JHKSB4YV"},"agent_actions":{"view_html":"https://pith.science/pith/JHKSB4YV6PHYGOC6WTK2X5KZAW","download_json":"https://pith.science/pith/JHKSB4YV6PHYGOC6WTK2X5KZAW.json","view_paper":"https://pith.science/paper/JHKSB4YV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.00840&json=true","fetch_graph":"https://pith.science/api/pith-number/JHKSB4YV6PHYGOC6WTK2X5KZAW/graph.json","fetch_events":"https://pith.science/api/pith-number/JHKSB4YV6PHYGOC6WTK2X5KZAW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JHKSB4YV6PHYGOC6WTK2X5KZAW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JHKSB4YV6PHYGOC6WTK2X5KZAW/action/storage_attestation","attest_author":"https://pith.science/pith/JHKSB4YV6PHYGOC6WTK2X5KZAW/action/author_attestation","sign_citation":"https://pith.science/pith/JHKSB4YV6PHYGOC6WTK2X5KZAW/action/citation_signature","submit_replication":"https://pith.science/pith/JHKSB4YV6PHYGOC6WTK2X5KZAW/action/replication_record"}},"created_at":"2026-05-18T00:16:57.538542+00:00","updated_at":"2026-05-18T00:16:57.538542+00:00"}