{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6UJW53LFB7R5A4FQP5QSJADW6P","short_pith_number":"pith:6UJW53LF","schema_version":"1.0","canonical_sha256":"f5136eed650fe3d070b07f61248076f3d44f552a67c4762b0c6828fc18fff542","source":{"kind":"arxiv","id":"1803.11032","version":2},"attestation_state":"computed","paper":{"title":"Some bounds on the uniquely restricted matching number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Rautenbach, M. F\\\"urst","submitted_at":"2018-03-29T12:36:28Z","abstract_excerpt":"A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. We establish tight lower bounds on the maximum size of a uniquely restricted matching in terms of order, size, and maximum degree."},"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":"1803.11032","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-29T12:36:28Z","cross_cats_sorted":[],"title_canon_sha256":"c8db12f0487b58774709cb97e674019daf8803f0626581d0e721af5f51d4d45a","abstract_canon_sha256":"a4a073718a857a989a9bf6e623f4fec5db4976469a4c9a219a8f42935f0ce590"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:23.652905Z","signature_b64":"nA1zIibqip4B59GJ3kR9Zrfry1Likge4ryXK0PSs6Vs2Y4u7TsTFo4lLJQ/ulu5zSjUDWFweqpEoiFYfJr4SBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5136eed650fe3d070b07f61248076f3d44f552a67c4762b0c6828fc18fff542","last_reissued_at":"2026-05-18T00:17:23.652216Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:23.652216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some bounds on the uniquely restricted matching number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Rautenbach, M. F\\\"urst","submitted_at":"2018-03-29T12:36:28Z","abstract_excerpt":"A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. We establish tight lower bounds on the maximum size of a uniquely restricted matching in terms of order, size, and maximum degree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.11032","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.11032","created_at":"2026-05-18T00:17:23.652337+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.11032v2","created_at":"2026-05-18T00:17:23.652337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.11032","created_at":"2026-05-18T00:17:23.652337+00:00"},{"alias_kind":"pith_short_12","alias_value":"6UJW53LFB7R5","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6UJW53LFB7R5A4FQ","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6UJW53LF","created_at":"2026-05-18T12:32:11.075285+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/6UJW53LFB7R5A4FQP5QSJADW6P","json":"https://pith.science/pith/6UJW53LFB7R5A4FQP5QSJADW6P.json","graph_json":"https://pith.science/api/pith-number/6UJW53LFB7R5A4FQP5QSJADW6P/graph.json","events_json":"https://pith.science/api/pith-number/6UJW53LFB7R5A4FQP5QSJADW6P/events.json","paper":"https://pith.science/paper/6UJW53LF"},"agent_actions":{"view_html":"https://pith.science/pith/6UJW53LFB7R5A4FQP5QSJADW6P","download_json":"https://pith.science/pith/6UJW53LFB7R5A4FQP5QSJADW6P.json","view_paper":"https://pith.science/paper/6UJW53LF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.11032&json=true","fetch_graph":"https://pith.science/api/pith-number/6UJW53LFB7R5A4FQP5QSJADW6P/graph.json","fetch_events":"https://pith.science/api/pith-number/6UJW53LFB7R5A4FQP5QSJADW6P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6UJW53LFB7R5A4FQP5QSJADW6P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6UJW53LFB7R5A4FQP5QSJADW6P/action/storage_attestation","attest_author":"https://pith.science/pith/6UJW53LFB7R5A4FQP5QSJADW6P/action/author_attestation","sign_citation":"https://pith.science/pith/6UJW53LFB7R5A4FQP5QSJADW6P/action/citation_signature","submit_replication":"https://pith.science/pith/6UJW53LFB7R5A4FQP5QSJADW6P/action/replication_record"}},"created_at":"2026-05-18T00:17:23.652337+00:00","updated_at":"2026-05-18T00:17:23.652337+00:00"}