{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2UJUDVI64LC5QBL7MZYR6ROAA6","short_pith_number":"pith:2UJUDVI6","schema_version":"1.0","canonical_sha256":"d51341d51ee2c5d8057f66711f45c007af7c56d83cb6706ff7d0723026c58847","source":{"kind":"arxiv","id":"1206.1877","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of Minimum Labeling Alignment of Two Genomes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","q-bio.GN"],"primary_cat":"cs.CC","authors_text":"Nadia El-Mabrouk, Riccardo Dondi","submitted_at":"2012-06-08T21:01:03Z","abstract_excerpt":"In this note we investigate the complexity of the Minimum Label Alignment problem and we show that such a problem is APX-hard."},"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":"1206.1877","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-06-08T21:01:03Z","cross_cats_sorted":["cs.DS","q-bio.GN"],"title_canon_sha256":"8cd9b69d8d3ea49513e87da756ebebedee66c61ee6e4dab9ea7cba60343784c9","abstract_canon_sha256":"205fa02ffaf1fd226c6585a4aa69ece5ae7d817fddc387d9429b0fac4d25aca5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:53.907896Z","signature_b64":"e/EMMul808IxItdDkoV9UMZEvIXCGN5nzopi4SXqrkSQ9m3LxEqBCRvfPUG4V+A1EmM3U3md5T3vjIH0ZsUkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d51341d51ee2c5d8057f66711f45c007af7c56d83cb6706ff7d0723026c58847","last_reissued_at":"2026-05-18T03:53:53.907234Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:53.907234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Minimum Labeling Alignment of Two Genomes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","q-bio.GN"],"primary_cat":"cs.CC","authors_text":"Nadia El-Mabrouk, Riccardo Dondi","submitted_at":"2012-06-08T21:01:03Z","abstract_excerpt":"In this note we investigate the complexity of the Minimum Label Alignment problem and we show that such a problem is APX-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1877","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":"1206.1877","created_at":"2026-05-18T03:53:53.907343+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.1877v1","created_at":"2026-05-18T03:53:53.907343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1877","created_at":"2026-05-18T03:53:53.907343+00:00"},{"alias_kind":"pith_short_12","alias_value":"2UJUDVI64LC5","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2UJUDVI64LC5QBL7","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2UJUDVI6","created_at":"2026-05-18T12:26:50.516681+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/2UJUDVI64LC5QBL7MZYR6ROAA6","json":"https://pith.science/pith/2UJUDVI64LC5QBL7MZYR6ROAA6.json","graph_json":"https://pith.science/api/pith-number/2UJUDVI64LC5QBL7MZYR6ROAA6/graph.json","events_json":"https://pith.science/api/pith-number/2UJUDVI64LC5QBL7MZYR6ROAA6/events.json","paper":"https://pith.science/paper/2UJUDVI6"},"agent_actions":{"view_html":"https://pith.science/pith/2UJUDVI64LC5QBL7MZYR6ROAA6","download_json":"https://pith.science/pith/2UJUDVI64LC5QBL7MZYR6ROAA6.json","view_paper":"https://pith.science/paper/2UJUDVI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.1877&json=true","fetch_graph":"https://pith.science/api/pith-number/2UJUDVI64LC5QBL7MZYR6ROAA6/graph.json","fetch_events":"https://pith.science/api/pith-number/2UJUDVI64LC5QBL7MZYR6ROAA6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2UJUDVI64LC5QBL7MZYR6ROAA6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2UJUDVI64LC5QBL7MZYR6ROAA6/action/storage_attestation","attest_author":"https://pith.science/pith/2UJUDVI64LC5QBL7MZYR6ROAA6/action/author_attestation","sign_citation":"https://pith.science/pith/2UJUDVI64LC5QBL7MZYR6ROAA6/action/citation_signature","submit_replication":"https://pith.science/pith/2UJUDVI64LC5QBL7MZYR6ROAA6/action/replication_record"}},"created_at":"2026-05-18T03:53:53.907343+00:00","updated_at":"2026-05-18T03:53:53.907343+00:00"}