{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:V7KGDWWPTWGFTF2KPRKGBIURVJ","short_pith_number":"pith:V7KGDWWP","schema_version":"1.0","canonical_sha256":"afd461dacf9d8c59974a7c5460a291aa5349b8a0e27862085ffe0621751d3150","source":{"kind":"arxiv","id":"1810.04473","version":1},"attestation_state":"computed","paper":{"title":"Uniquely restricted matchings in subcubic graphs without short cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Maximilian F\\\"urst","submitted_at":"2018-10-10T12:11:49Z","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 prove that any connected subcubic graph with $n$ vertices and girth at least $5$ contains a uniquely restricted matching of size at least $(n-1) / 3$ except for two exceptional cubic graphs of order $14$ and $20$."},"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":"1810.04473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-10T12:11:49Z","cross_cats_sorted":[],"title_canon_sha256":"e31c99f8f16043a3b936ef3c2c373eb2b99db1204faa105d8b13788c364c46e4","abstract_canon_sha256":"2b0c34956f4af9152613d37c95af7423ecaded602940a4c7c5677d74d2c110cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:40.040698Z","signature_b64":"tcCG0nRA+7Lp2KXGnWSIGw/daE+cUD+guqyXdO6HWMW1Jk5a/kZgtiHeA9OZU1XYBR7cQx5Bn8HkLnHMwX/fBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afd461dacf9d8c59974a7c5460a291aa5349b8a0e27862085ffe0621751d3150","last_reissued_at":"2026-05-18T00:03:40.040220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:40.040220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniquely restricted matchings in subcubic graphs without short cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Maximilian F\\\"urst","submitted_at":"2018-10-10T12:11:49Z","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 prove that any connected subcubic graph with $n$ vertices and girth at least $5$ contains a uniquely restricted matching of size at least $(n-1) / 3$ except for two exceptional cubic graphs of order $14$ and $20$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04473","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":"1810.04473","created_at":"2026-05-18T00:03:40.040297+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.04473v1","created_at":"2026-05-18T00:03:40.040297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04473","created_at":"2026-05-18T00:03:40.040297+00:00"},{"alias_kind":"pith_short_12","alias_value":"V7KGDWWPTWGF","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"V7KGDWWPTWGFTF2K","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"V7KGDWWP","created_at":"2026-05-18T12:32:59.047623+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/V7KGDWWPTWGFTF2KPRKGBIURVJ","json":"https://pith.science/pith/V7KGDWWPTWGFTF2KPRKGBIURVJ.json","graph_json":"https://pith.science/api/pith-number/V7KGDWWPTWGFTF2KPRKGBIURVJ/graph.json","events_json":"https://pith.science/api/pith-number/V7KGDWWPTWGFTF2KPRKGBIURVJ/events.json","paper":"https://pith.science/paper/V7KGDWWP"},"agent_actions":{"view_html":"https://pith.science/pith/V7KGDWWPTWGFTF2KPRKGBIURVJ","download_json":"https://pith.science/pith/V7KGDWWPTWGFTF2KPRKGBIURVJ.json","view_paper":"https://pith.science/paper/V7KGDWWP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.04473&json=true","fetch_graph":"https://pith.science/api/pith-number/V7KGDWWPTWGFTF2KPRKGBIURVJ/graph.json","fetch_events":"https://pith.science/api/pith-number/V7KGDWWPTWGFTF2KPRKGBIURVJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V7KGDWWPTWGFTF2KPRKGBIURVJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V7KGDWWPTWGFTF2KPRKGBIURVJ/action/storage_attestation","attest_author":"https://pith.science/pith/V7KGDWWPTWGFTF2KPRKGBIURVJ/action/author_attestation","sign_citation":"https://pith.science/pith/V7KGDWWPTWGFTF2KPRKGBIURVJ/action/citation_signature","submit_replication":"https://pith.science/pith/V7KGDWWPTWGFTF2KPRKGBIURVJ/action/replication_record"}},"created_at":"2026-05-18T00:03:40.040297+00:00","updated_at":"2026-05-18T00:03:40.040297+00:00"}