{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IOYDBYELJKDTBZX6VMKEES6T6K","short_pith_number":"pith:IOYDBYEL","canonical_record":{"source":{"id":"1604.07016","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-24T11:52:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e6dc3fe4bd08b2b0731b288c7b8f8604d658a35684470077199ff1c4e8d03c6b","abstract_canon_sha256":"2c30705a533333925468f8188e2121ec4e91a9251235645cff82dc89c4f1313f"},"schema_version":"1.0"},"canonical_sha256":"43b030e08b4a8730e6feab14424bd3f2ac186e63bf787615f0689e611cda4fae","source":{"kind":"arxiv","id":"1604.07016","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07016","created_at":"2026-05-18T01:15:13Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07016v2","created_at":"2026-05-18T01:15:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07016","created_at":"2026-05-18T01:15:13Z"},{"alias_kind":"pith_short_12","alias_value":"IOYDBYELJKDT","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IOYDBYELJKDTBZX6","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IOYDBYEL","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IOYDBYELJKDTBZX6VMKEES6T6K","target":"record","payload":{"canonical_record":{"source":{"id":"1604.07016","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-24T11:52:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e6dc3fe4bd08b2b0731b288c7b8f8604d658a35684470077199ff1c4e8d03c6b","abstract_canon_sha256":"2c30705a533333925468f8188e2121ec4e91a9251235645cff82dc89c4f1313f"},"schema_version":"1.0"},"canonical_sha256":"43b030e08b4a8730e6feab14424bd3f2ac186e63bf787615f0689e611cda4fae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:13.502264Z","signature_b64":"ZTWFEMAjoMXUVvZ86KnwXkjg/WwOVeA85Ev0mkIFoiodrCpf9lx2v78FFX0YsuTMLoaxeOVzgzHAO2WqZ3TFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43b030e08b4a8730e6feab14424bd3f2ac186e63bf787615f0689e611cda4fae","last_reissued_at":"2026-05-18T01:15:13.501634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:13.501634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.07016","source_version":2,"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-18T01:15:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t8eWBrNIFgQ8srcvk80HP0JDDB+hp7ux2AZdebZnkLHos7V0ZXk8yCTjDymj0RkP8VCfQGzfCumM4pUYF14tBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:56:50.254519Z"},"content_sha256":"100725ac4bea063c032d0d26b0ca92bbef5ba9261df62db00c77130e6a0f5631","schema_version":"1.0","event_id":"sha256:100725ac4bea063c032d0d26b0ca92bbef5ba9261df62db00c77130e6a0f5631"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IOYDBYELJKDTBZX6VMKEES6T6K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uniquely Restricted Matchings in Interval Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Dalu Jacob, Mathew C. Francis, Satyabrata Jana","submitted_at":"2016-04-24T11:52:17Z","abstract_excerpt":"A matching $M$ in a graph $G$ is said to be uniquely restricted if there is no other matching in $G$ that matches the same set of vertices as $M$. We describe a polynomial-time algorithm to compute a maximum cardinality uniquely restricted matching in an interval graph, thereby answering a question of Golumbic et al. (\"Uniquely restricted matchings\", M. C. Golumbic, T. Hirst and M. Lewenstein, Algorithmica, 31:139--154, 2001). Our algorithm actually solves the more general problem of computing a maximum cardinality \"strong independent set\" in an interval nest digraph, which may be of independe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07016","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"},"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-18T01:15:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rKW8bIot6f/knL27fqJ8RzQYNC4TQvGGKwt3RFz1PHiwiOnxui24JqlRamBEu8QISD8IXNtmzarY39+d3ur3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:56:50.254882Z"},"content_sha256":"89cbf5d83bd838309de0d7fa0c77f5b178b91580b0dde1d5e798643a8f2c0031","schema_version":"1.0","event_id":"sha256:89cbf5d83bd838309de0d7fa0c77f5b178b91580b0dde1d5e798643a8f2c0031"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IOYDBYELJKDTBZX6VMKEES6T6K/bundle.json","state_url":"https://pith.science/pith/IOYDBYELJKDTBZX6VMKEES6T6K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IOYDBYELJKDTBZX6VMKEES6T6K/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-09T17:56:50Z","links":{"resolver":"https://pith.science/pith/IOYDBYELJKDTBZX6VMKEES6T6K","bundle":"https://pith.science/pith/IOYDBYELJKDTBZX6VMKEES6T6K/bundle.json","state":"https://pith.science/pith/IOYDBYELJKDTBZX6VMKEES6T6K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IOYDBYELJKDTBZX6VMKEES6T6K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IOYDBYELJKDTBZX6VMKEES6T6K","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":"2c30705a533333925468f8188e2121ec4e91a9251235645cff82dc89c4f1313f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-24T11:52:17Z","title_canon_sha256":"e6dc3fe4bd08b2b0731b288c7b8f8604d658a35684470077199ff1c4e8d03c6b"},"schema_version":"1.0","source":{"id":"1604.07016","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07016","created_at":"2026-05-18T01:15:13Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07016v2","created_at":"2026-05-18T01:15:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07016","created_at":"2026-05-18T01:15:13Z"},{"alias_kind":"pith_short_12","alias_value":"IOYDBYELJKDT","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IOYDBYELJKDTBZX6","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IOYDBYEL","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:89cbf5d83bd838309de0d7fa0c77f5b178b91580b0dde1d5e798643a8f2c0031","target":"graph","created_at":"2026-05-18T01:15:13Z","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 said to be uniquely restricted if there is no other matching in $G$ that matches the same set of vertices as $M$. We describe a polynomial-time algorithm to compute a maximum cardinality uniquely restricted matching in an interval graph, thereby answering a question of Golumbic et al. (\"Uniquely restricted matchings\", M. C. Golumbic, T. Hirst and M. Lewenstein, Algorithmica, 31:139--154, 2001). Our algorithm actually solves the more general problem of computing a maximum cardinality \"strong independent set\" in an interval nest digraph, which may be of independe","authors_text":"Dalu Jacob, Mathew C. Francis, Satyabrata Jana","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-24T11:52:17Z","title":"Uniquely Restricted Matchings in Interval Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07016","kind":"arxiv","version":2},"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:100725ac4bea063c032d0d26b0ca92bbef5ba9261df62db00c77130e6a0f5631","target":"record","created_at":"2026-05-18T01:15:13Z","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":"2c30705a533333925468f8188e2121ec4e91a9251235645cff82dc89c4f1313f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-24T11:52:17Z","title_canon_sha256":"e6dc3fe4bd08b2b0731b288c7b8f8604d658a35684470077199ff1c4e8d03c6b"},"schema_version":"1.0","source":{"id":"1604.07016","kind":"arxiv","version":2}},"canonical_sha256":"43b030e08b4a8730e6feab14424bd3f2ac186e63bf787615f0689e611cda4fae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43b030e08b4a8730e6feab14424bd3f2ac186e63bf787615f0689e611cda4fae","first_computed_at":"2026-05-18T01:15:13.501634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:13.501634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZTWFEMAjoMXUVvZ86KnwXkjg/WwOVeA85Ev0mkIFoiodrCpf9lx2v78FFX0YsuTMLoaxeOVzgzHAO2WqZ3TFBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:13.502264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.07016","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:100725ac4bea063c032d0d26b0ca92bbef5ba9261df62db00c77130e6a0f5631","sha256:89cbf5d83bd838309de0d7fa0c77f5b178b91580b0dde1d5e798643a8f2c0031"],"state_sha256":"721b96a95ab0b4bcbc94916cab0df47845c6859264be98f3f64465e370452476"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ucuiroKhDT/9zzeNIe/ok636JawHdU04ccR5QUSB0onzOeZ3zn9ncUb4++7Ag6jAeZSGf1RSdTS5UN/ol2HeBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T17:56:50.256887Z","bundle_sha256":"a5291e0973409c41bc8a39afc327e7f1a26b7af5f2ab941072adb54f502ad876"}}