{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ORDUEN7T34N7R7JUPSKLSD2AZF","short_pith_number":"pith:ORDUEN7T","schema_version":"1.0","canonical_sha256":"74474237f3df1bf8fd347c94b90f40c94c466a63953395c6d0ac8f02b11d52fe","source":{"kind":"arxiv","id":"1308.5741","version":1},"attestation_state":"computed","paper":{"title":"Fixed parameter tractability of crossing minimization of almost-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"David Eppstein, Joseph A. Simons, Michael J. Bannister","submitted_at":"2013-08-27T02:45:22Z","abstract_excerpt":"We investigate exact crossing minimization for graphs that differ from trees by a small number of additional edges, for several variants of the crossing minimization problem. In particular, we provide fixed parameter tractable algorithms for the 1-page book crossing number, the 2-page book crossing number, and the minimum number of crossed edges in 1-page and 2-page book drawings."},"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":"1308.5741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-08-27T02:45:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d919b257d7e789796315dbd8600829f24dde838de280a66342939ffbb25208f3","abstract_canon_sha256":"a2e67e1900676d31f9771629bf986dd51c0fc5763709ed0768ceda790c7d4196"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:38.750149Z","signature_b64":"b6an9T8d53lohQyK8epIEMWgwpF8Y4E1BM+jfOyK7WmlkZomvsDVSvijjPgZHm2MhLQv5YZ2Jx/GbkTV8jp0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74474237f3df1bf8fd347c94b90f40c94c466a63953395c6d0ac8f02b11d52fe","last_reissued_at":"2026-05-18T03:14:38.749653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:38.749653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed parameter tractability of crossing minimization of almost-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"David Eppstein, Joseph A. Simons, Michael J. Bannister","submitted_at":"2013-08-27T02:45:22Z","abstract_excerpt":"We investigate exact crossing minimization for graphs that differ from trees by a small number of additional edges, for several variants of the crossing minimization problem. In particular, we provide fixed parameter tractable algorithms for the 1-page book crossing number, the 2-page book crossing number, and the minimum number of crossed edges in 1-page and 2-page book drawings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5741","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":"1308.5741","created_at":"2026-05-18T03:14:38.749728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.5741v1","created_at":"2026-05-18T03:14:38.749728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5741","created_at":"2026-05-18T03:14:38.749728+00:00"},{"alias_kind":"pith_short_12","alias_value":"ORDUEN7T34N7","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"ORDUEN7T34N7R7JU","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"ORDUEN7T","created_at":"2026-05-18T12:27:54.935989+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/ORDUEN7T34N7R7JUPSKLSD2AZF","json":"https://pith.science/pith/ORDUEN7T34N7R7JUPSKLSD2AZF.json","graph_json":"https://pith.science/api/pith-number/ORDUEN7T34N7R7JUPSKLSD2AZF/graph.json","events_json":"https://pith.science/api/pith-number/ORDUEN7T34N7R7JUPSKLSD2AZF/events.json","paper":"https://pith.science/paper/ORDUEN7T"},"agent_actions":{"view_html":"https://pith.science/pith/ORDUEN7T34N7R7JUPSKLSD2AZF","download_json":"https://pith.science/pith/ORDUEN7T34N7R7JUPSKLSD2AZF.json","view_paper":"https://pith.science/paper/ORDUEN7T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.5741&json=true","fetch_graph":"https://pith.science/api/pith-number/ORDUEN7T34N7R7JUPSKLSD2AZF/graph.json","fetch_events":"https://pith.science/api/pith-number/ORDUEN7T34N7R7JUPSKLSD2AZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ORDUEN7T34N7R7JUPSKLSD2AZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ORDUEN7T34N7R7JUPSKLSD2AZF/action/storage_attestation","attest_author":"https://pith.science/pith/ORDUEN7T34N7R7JUPSKLSD2AZF/action/author_attestation","sign_citation":"https://pith.science/pith/ORDUEN7T34N7R7JUPSKLSD2AZF/action/citation_signature","submit_replication":"https://pith.science/pith/ORDUEN7T34N7R7JUPSKLSD2AZF/action/replication_record"}},"created_at":"2026-05-18T03:14:38.749728+00:00","updated_at":"2026-05-18T03:14:38.749728+00:00"}