{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DNTJ2NKO2OJDQGKZX7EF2BCOXQ","short_pith_number":"pith:DNTJ2NKO","schema_version":"1.0","canonical_sha256":"1b669d354ed392381959bfc85d044ebc0799cef0405903abc064916d26c16dde","source":{"kind":"arxiv","id":"1907.04132","version":1},"attestation_state":"computed","paper":{"title":"Linear MIM-Width of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Erlend Raa V{\\aa}gset, Jan Arne Telle, Svein H{\\o}gemo","submitted_at":"2019-07-09T13:14:12Z","abstract_excerpt":"We provide an $O(n \\log n)$ algorithm computing the linear maximum induced matching width of a tree and an optimal layout."},"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":"1907.04132","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T13:14:12Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a836b0329dd3732da647918d39e8f6642a42dbc9632b26296100990aabee54fb","abstract_canon_sha256":"e15f806541feed86109754d5b75bef23f22358b52743c415b0bdfc0f4586ea39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:03.245654Z","signature_b64":"4TGLVltfFaFWrEhBJ41sSCwMGece7AAKTdKKgenv+HbPvj16byOBqPpdLP9oL5bnp00A7ArRxrXBUsvRiz18DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b669d354ed392381959bfc85d044ebc0799cef0405903abc064916d26c16dde","last_reissued_at":"2026-05-17T23:41:03.245012Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:03.245012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear MIM-Width of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Erlend Raa V{\\aa}gset, Jan Arne Telle, Svein H{\\o}gemo","submitted_at":"2019-07-09T13:14:12Z","abstract_excerpt":"We provide an $O(n \\log n)$ algorithm computing the linear maximum induced matching width of a tree and an optimal layout."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04132","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":"1907.04132","created_at":"2026-05-17T23:41:03.245132+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.04132v1","created_at":"2026-05-17T23:41:03.245132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04132","created_at":"2026-05-17T23:41:03.245132+00:00"},{"alias_kind":"pith_short_12","alias_value":"DNTJ2NKO2OJD","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"DNTJ2NKO2OJDQGKZ","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"DNTJ2NKO","created_at":"2026-05-18T12:33:15.570797+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/DNTJ2NKO2OJDQGKZX7EF2BCOXQ","json":"https://pith.science/pith/DNTJ2NKO2OJDQGKZX7EF2BCOXQ.json","graph_json":"https://pith.science/api/pith-number/DNTJ2NKO2OJDQGKZX7EF2BCOXQ/graph.json","events_json":"https://pith.science/api/pith-number/DNTJ2NKO2OJDQGKZX7EF2BCOXQ/events.json","paper":"https://pith.science/paper/DNTJ2NKO"},"agent_actions":{"view_html":"https://pith.science/pith/DNTJ2NKO2OJDQGKZX7EF2BCOXQ","download_json":"https://pith.science/pith/DNTJ2NKO2OJDQGKZX7EF2BCOXQ.json","view_paper":"https://pith.science/paper/DNTJ2NKO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.04132&json=true","fetch_graph":"https://pith.science/api/pith-number/DNTJ2NKO2OJDQGKZX7EF2BCOXQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DNTJ2NKO2OJDQGKZX7EF2BCOXQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DNTJ2NKO2OJDQGKZX7EF2BCOXQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DNTJ2NKO2OJDQGKZX7EF2BCOXQ/action/storage_attestation","attest_author":"https://pith.science/pith/DNTJ2NKO2OJDQGKZX7EF2BCOXQ/action/author_attestation","sign_citation":"https://pith.science/pith/DNTJ2NKO2OJDQGKZX7EF2BCOXQ/action/citation_signature","submit_replication":"https://pith.science/pith/DNTJ2NKO2OJDQGKZX7EF2BCOXQ/action/replication_record"}},"created_at":"2026-05-17T23:41:03.245132+00:00","updated_at":"2026-05-17T23:41:03.245132+00:00"}