{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OBU66AXYZBG4Y2TQPZRNPR5NB3","short_pith_number":"pith:OBU66AXY","canonical_record":{"source":{"id":"1507.02384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-09T05:58:47Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"a6a18a0cfdf85b2b602faa64269059135ddfca76bc3b036c1dbdefd22b95c2fc","abstract_canon_sha256":"ac617e51ede4eca1d23d63ba817085977d677f44eefee46b90b40b4f273b7bf8"},"schema_version":"1.0"},"canonical_sha256":"7069ef02f8c84dcc6a707e62d7c7ad0ee5a161de23dbd62f44e913a704cfccb1","source":{"kind":"arxiv","id":"1507.02384","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02384","created_at":"2026-05-18T01:37:06Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02384v1","created_at":"2026-05-18T01:37:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02384","created_at":"2026-05-18T01:37:06Z"},{"alias_kind":"pith_short_12","alias_value":"OBU66AXYZBG4","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OBU66AXYZBG4Y2TQ","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OBU66AXY","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OBU66AXYZBG4Y2TQPZRNPR5NB3","target":"record","payload":{"canonical_record":{"source":{"id":"1507.02384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-09T05:58:47Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"a6a18a0cfdf85b2b602faa64269059135ddfca76bc3b036c1dbdefd22b95c2fc","abstract_canon_sha256":"ac617e51ede4eca1d23d63ba817085977d677f44eefee46b90b40b4f273b7bf8"},"schema_version":"1.0"},"canonical_sha256":"7069ef02f8c84dcc6a707e62d7c7ad0ee5a161de23dbd62f44e913a704cfccb1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:06.842929Z","signature_b64":"nbJRZarDaVAmKz3yJFUrcrNzDY8SwzJBAgOgmVO2lXQQm6sHNHlhD1s+LuUiJOwHInM9W1hAxdYolJDjTxnSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7069ef02f8c84dcc6a707e62d7c7ad0ee5a161de23dbd62f44e913a704cfccb1","last_reissued_at":"2026-05-18T01:37:06.842337Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:06.842337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.02384","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-18T01:37:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/+TzVvYH88QF/BE7/tnX6m/FvthKj8ZB0IXN9+CgQYO0aVnorBiFL819Ddv16cjVHhMJv0RKBA9inoo2xaSqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:17:17.840771Z"},"content_sha256":"2524f654c397c906cf297f70e6fe64722d9861d29dd13653ae5cfcef11ea149d","schema_version":"1.0","event_id":"sha256:2524f654c397c906cf297f70e6fe64722d9861d29dd13653ae5cfcef11ea149d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OBU66AXYZBG4Y2TQPZRNPR5NB3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum matching width: new characterizations and a fast algorithm for dominating set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Jan Arne Telle, Jisu Jeong, Sigve Hortemo S{\\ae}ther","submitted_at":"2015-07-09T05:58:47Z","abstract_excerpt":"We give alternative definitions for maximum matching width, e.g. a graph $G$ has $\\operatorname{mmw}(G) \\leq k$ if and only if it is a subgraph of a chordal graph $H$ and for every maximal clique $X$ of $H$ there exists $A,B,C \\subseteq X$ with $A \\cup B \\cup C=X$ and $|A|,|B|,|C| \\leq k$ such that any subset of $X$ that is a minimal separator of $H$ is a subset of either $A, B$ or $C$. Treewidth and branchwidth have alternative definitions through intersections of subtrees, where treewidth focuses on nodes and branchwidth focuses on edges. We show that mm-width combines both aspects, focusing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02384","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-18T01:37:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dtmrK1Kl3xA9ZQxIpiW6yy+ZfAWll1Uo7P2bpF5VGKOWoCx8MBu2okip1XXNq5ASI4pCcFxOgjlENKuO8QECBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:17:17.841484Z"},"content_sha256":"e2f9a654a738a942f3f15dc00c976d940e82e2b796a81c8647d5400953ee1477","schema_version":"1.0","event_id":"sha256:e2f9a654a738a942f3f15dc00c976d940e82e2b796a81c8647d5400953ee1477"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OBU66AXYZBG4Y2TQPZRNPR5NB3/bundle.json","state_url":"https://pith.science/pith/OBU66AXYZBG4Y2TQPZRNPR5NB3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OBU66AXYZBG4Y2TQPZRNPR5NB3/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-09T10:17:17Z","links":{"resolver":"https://pith.science/pith/OBU66AXYZBG4Y2TQPZRNPR5NB3","bundle":"https://pith.science/pith/OBU66AXYZBG4Y2TQPZRNPR5NB3/bundle.json","state":"https://pith.science/pith/OBU66AXYZBG4Y2TQPZRNPR5NB3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OBU66AXYZBG4Y2TQPZRNPR5NB3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OBU66AXYZBG4Y2TQPZRNPR5NB3","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":"ac617e51ede4eca1d23d63ba817085977d677f44eefee46b90b40b4f273b7bf8","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-09T05:58:47Z","title_canon_sha256":"a6a18a0cfdf85b2b602faa64269059135ddfca76bc3b036c1dbdefd22b95c2fc"},"schema_version":"1.0","source":{"id":"1507.02384","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02384","created_at":"2026-05-18T01:37:06Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02384v1","created_at":"2026-05-18T01:37:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02384","created_at":"2026-05-18T01:37:06Z"},{"alias_kind":"pith_short_12","alias_value":"OBU66AXYZBG4","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OBU66AXYZBG4Y2TQ","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OBU66AXY","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:e2f9a654a738a942f3f15dc00c976d940e82e2b796a81c8647d5400953ee1477","target":"graph","created_at":"2026-05-18T01:37:06Z","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":"We give alternative definitions for maximum matching width, e.g. a graph $G$ has $\\operatorname{mmw}(G) \\leq k$ if and only if it is a subgraph of a chordal graph $H$ and for every maximal clique $X$ of $H$ there exists $A,B,C \\subseteq X$ with $A \\cup B \\cup C=X$ and $|A|,|B|,|C| \\leq k$ such that any subset of $X$ that is a minimal separator of $H$ is a subset of either $A, B$ or $C$. Treewidth and branchwidth have alternative definitions through intersections of subtrees, where treewidth focuses on nodes and branchwidth focuses on edges. We show that mm-width combines both aspects, focusing","authors_text":"Jan Arne Telle, Jisu Jeong, Sigve Hortemo S{\\ae}ther","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-09T05:58:47Z","title":"Maximum matching width: new characterizations and a fast algorithm for dominating set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02384","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:2524f654c397c906cf297f70e6fe64722d9861d29dd13653ae5cfcef11ea149d","target":"record","created_at":"2026-05-18T01:37:06Z","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":"ac617e51ede4eca1d23d63ba817085977d677f44eefee46b90b40b4f273b7bf8","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-09T05:58:47Z","title_canon_sha256":"a6a18a0cfdf85b2b602faa64269059135ddfca76bc3b036c1dbdefd22b95c2fc"},"schema_version":"1.0","source":{"id":"1507.02384","kind":"arxiv","version":1}},"canonical_sha256":"7069ef02f8c84dcc6a707e62d7c7ad0ee5a161de23dbd62f44e913a704cfccb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7069ef02f8c84dcc6a707e62d7c7ad0ee5a161de23dbd62f44e913a704cfccb1","first_computed_at":"2026-05-18T01:37:06.842337Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:06.842337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nbJRZarDaVAmKz3yJFUrcrNzDY8SwzJBAgOgmVO2lXQQm6sHNHlhD1s+LuUiJOwHInM9W1hAxdYolJDjTxnSBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:06.842929Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02384","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2524f654c397c906cf297f70e6fe64722d9861d29dd13653ae5cfcef11ea149d","sha256:e2f9a654a738a942f3f15dc00c976d940e82e2b796a81c8647d5400953ee1477"],"state_sha256":"0899f8a0bb8d90575177fe6b04e935302c8ee6ed1c86c6496ca248a3e36f1e6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KufO96JJLwZ7mN2Wog5u2TNvnTIZTIK0seYsyXzK1DbQN1t+G8NTmNDAx1bJIiDbSozxjzDTf+71VpeWoWeQAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T10:17:17.845860Z","bundle_sha256":"87538ddb7c81390fad0b5edef6c43825bef9c71d7068b459ae4ae07b70ec8b38"}}