{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TEPNRALPJ5ROSTIDJEHDUV2YHZ","short_pith_number":"pith:TEPNRALP","canonical_record":{"source":{"id":"1807.08981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-24T09:17:05Z","cross_cats_sorted":[],"title_canon_sha256":"e9f44f8e5f2334cc9fb64d929f9f21e3b523f192f9cea97b8692840ba0e204c7","abstract_canon_sha256":"cb6e4c1893f47562dd1510e52e4584494db7eb405093f75ed190811be0a2d002"},"schema_version":"1.0"},"canonical_sha256":"991ed8816f4f62e94d03490e3a57583e7753e7c396d123552ad75277e4a04932","source":{"kind":"arxiv","id":"1807.08981","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08981","created_at":"2026-05-18T00:09:57Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08981v1","created_at":"2026-05-18T00:09:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08981","created_at":"2026-05-18T00:09:57Z"},{"alias_kind":"pith_short_12","alias_value":"TEPNRALPJ5RO","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TEPNRALPJ5ROSTID","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TEPNRALP","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TEPNRALPJ5ROSTIDJEHDUV2YHZ","target":"record","payload":{"canonical_record":{"source":{"id":"1807.08981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-24T09:17:05Z","cross_cats_sorted":[],"title_canon_sha256":"e9f44f8e5f2334cc9fb64d929f9f21e3b523f192f9cea97b8692840ba0e204c7","abstract_canon_sha256":"cb6e4c1893f47562dd1510e52e4584494db7eb405093f75ed190811be0a2d002"},"schema_version":"1.0"},"canonical_sha256":"991ed8816f4f62e94d03490e3a57583e7753e7c396d123552ad75277e4a04932","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:57.168258Z","signature_b64":"LeUbHI/Pym8lcLOdng2NAAFuSNl43NCLywltbJCJWptcb0lQuqF8aAtVm43lZKNSR9hzl9YTDqAD1pfbM6KmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"991ed8816f4f62e94d03490e3a57583e7753e7c396d123552ad75277e4a04932","last_reissued_at":"2026-05-18T00:09:57.167641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:57.167641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.08981","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:09:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wJQV1oXcOjOinaNBD5IaLF4KnLyNQgqCLkP6mw/qP7BPZQleh9CO66KjwyS79s/JKAwT/tV25swystU7XTreDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:18:33.290017Z"},"content_sha256":"3a3ae0c42a9a75df12ca7a4f6d3fc523714be2f3736fe2f285d518f17de67cb5","schema_version":"1.0","event_id":"sha256:3a3ae0c42a9a75df12ca7a4f6d3fc523714be2f3736fe2f285d518f17de67cb5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TEPNRALPJ5ROSTIDJEHDUV2YHZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs","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-07-24T09:17:05Z","abstract_excerpt":"For a matching $M$ in a graph $G$, let $G(M)$ be the subgraph of $G$ induced by the vertices of $G$ that are incident with an edge in $M$. The matching $M$ is induced, if $G(M)$ is $1$-regular, and $M$ is uniquely restricted, if $M$ is the unique perfect matching of $G(M)$. The induced matching number $\\nu_s(G)$ of $G$ is the largest size of an induced matching in $G$, and the uniquely restricted matching number $\\nu_{ur}(G)$ of $G$ is the largest size of a uniquely restricted matching in $G$.\n  Golumbic, Hirst, and Lewenstein (Uniquely restricted matchings, Algorithmica 31 (2001) 139-154) pos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08981","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:09:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"99SKE8oPvcOUJWWmlGc4lHu8HHAvlbGlo0+XCcO9PL+/y4I32a65UAlFq9eEcx/jg5nl8QLyjNV0Q2q2JZOSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:18:33.290795Z"},"content_sha256":"2a69292993d0769dbe51775b69ee717c2ededbc961cd13d830622ced5ece4e0f","schema_version":"1.0","event_id":"sha256:2a69292993d0769dbe51775b69ee717c2ededbc961cd13d830622ced5ece4e0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TEPNRALPJ5ROSTIDJEHDUV2YHZ/bundle.json","state_url":"https://pith.science/pith/TEPNRALPJ5ROSTIDJEHDUV2YHZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TEPNRALPJ5ROSTIDJEHDUV2YHZ/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-05-31T12:18:33Z","links":{"resolver":"https://pith.science/pith/TEPNRALPJ5ROSTIDJEHDUV2YHZ","bundle":"https://pith.science/pith/TEPNRALPJ5ROSTIDJEHDUV2YHZ/bundle.json","state":"https://pith.science/pith/TEPNRALPJ5ROSTIDJEHDUV2YHZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TEPNRALPJ5ROSTIDJEHDUV2YHZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TEPNRALPJ5ROSTIDJEHDUV2YHZ","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":"cb6e4c1893f47562dd1510e52e4584494db7eb405093f75ed190811be0a2d002","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-24T09:17:05Z","title_canon_sha256":"e9f44f8e5f2334cc9fb64d929f9f21e3b523f192f9cea97b8692840ba0e204c7"},"schema_version":"1.0","source":{"id":"1807.08981","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08981","created_at":"2026-05-18T00:09:57Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08981v1","created_at":"2026-05-18T00:09:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08981","created_at":"2026-05-18T00:09:57Z"},{"alias_kind":"pith_short_12","alias_value":"TEPNRALPJ5RO","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TEPNRALPJ5ROSTID","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TEPNRALP","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:2a69292993d0769dbe51775b69ee717c2ededbc961cd13d830622ced5ece4e0f","target":"graph","created_at":"2026-05-18T00:09: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":"For a matching $M$ in a graph $G$, let $G(M)$ be the subgraph of $G$ induced by the vertices of $G$ that are incident with an edge in $M$. The matching $M$ is induced, if $G(M)$ is $1$-regular, and $M$ is uniquely restricted, if $M$ is the unique perfect matching of $G(M)$. The induced matching number $\\nu_s(G)$ of $G$ is the largest size of an induced matching in $G$, and the uniquely restricted matching number $\\nu_{ur}(G)$ of $G$ is the largest size of a uniquely restricted matching in $G$.\n  Golumbic, Hirst, and Lewenstein (Uniquely restricted matchings, Algorithmica 31 (2001) 139-154) pos","authors_text":"D. Rautenbach, M. F\\\"urst","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-24T09:17:05Z","title":"On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08981","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:3a3ae0c42a9a75df12ca7a4f6d3fc523714be2f3736fe2f285d518f17de67cb5","target":"record","created_at":"2026-05-18T00:09: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":"cb6e4c1893f47562dd1510e52e4584494db7eb405093f75ed190811be0a2d002","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-24T09:17:05Z","title_canon_sha256":"e9f44f8e5f2334cc9fb64d929f9f21e3b523f192f9cea97b8692840ba0e204c7"},"schema_version":"1.0","source":{"id":"1807.08981","kind":"arxiv","version":1}},"canonical_sha256":"991ed8816f4f62e94d03490e3a57583e7753e7c396d123552ad75277e4a04932","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"991ed8816f4f62e94d03490e3a57583e7753e7c396d123552ad75277e4a04932","first_computed_at":"2026-05-18T00:09:57.167641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:57.167641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LeUbHI/Pym8lcLOdng2NAAFuSNl43NCLywltbJCJWptcb0lQuqF8aAtVm43lZKNSR9hzl9YTDqAD1pfbM6KmDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:57.168258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.08981","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a3ae0c42a9a75df12ca7a4f6d3fc523714be2f3736fe2f285d518f17de67cb5","sha256:2a69292993d0769dbe51775b69ee717c2ededbc961cd13d830622ced5ece4e0f"],"state_sha256":"f2e3e05896e87af07724c4c6339afebfc3117533ee8df6626a8f520c93c8e600"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wjDRUyOvSdw5EehtFjUzOx4A1A+R5D9Vg9Ut0k6wKD5inksX29HaLN5t8CgVN8V2L/ogFdnSRfHFXtENkiSYAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:18:33.294880Z","bundle_sha256":"d1dc3b1e3fcef228db7a8473094fc7c187786d6eef2c1f7f8ff176cb51056f19"}}