{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:H2DA55GMQPWOQFT6GHQEKZLOJP","short_pith_number":"pith:H2DA55GM","schema_version":"1.0","canonical_sha256":"3e860ef4cc83ece8167e31e045656e4bdf235267c1421d92b0aa7c6087887e69","source":{"kind":"arxiv","id":"0812.5101","version":1},"attestation_state":"computed","paper":{"title":"A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.GT","authors_text":"Aleksander Madry, Katarzyna Paluch, Marcin Mucha","submitted_at":"2008-12-30T19:11:48Z","abstract_excerpt":"We give a 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem."},"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":"0812.5101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2008-12-30T19:11:48Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"9ce9ccff05a4d185a7d964e21cb2bb72a18104ca3e92b4faefef837566eca266","abstract_canon_sha256":"5fc28fcac84ee3b4b82187006c07af975257b50a4ca70e6f28693ed3f97e482e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:15:03.595843Z","signature_b64":"c96EpAFLFkeEymbS2BgwVtHhOJ0XakrmJAj9myPfCTTj2ZWU+mtrJt7Jj0//rk+RDmcpGMDUHd4MIWaZP6yODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e860ef4cc83ece8167e31e045656e4bdf235267c1421d92b0aa7c6087887e69","last_reissued_at":"2026-05-18T02:15:03.595422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:15:03.595422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.GT","authors_text":"Aleksander Madry, Katarzyna Paluch, Marcin Mucha","submitted_at":"2008-12-30T19:11:48Z","abstract_excerpt":"We give a 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0812.5101","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":"0812.5101","created_at":"2026-05-18T02:15:03.595492+00:00"},{"alias_kind":"arxiv_version","alias_value":"0812.5101v1","created_at":"2026-05-18T02:15:03.595492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0812.5101","created_at":"2026-05-18T02:15:03.595492+00:00"},{"alias_kind":"pith_short_12","alias_value":"H2DA55GMQPWO","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"H2DA55GMQPWOQFT6","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"H2DA55GM","created_at":"2026-05-18T12:25:57.157939+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/H2DA55GMQPWOQFT6GHQEKZLOJP","json":"https://pith.science/pith/H2DA55GMQPWOQFT6GHQEKZLOJP.json","graph_json":"https://pith.science/api/pith-number/H2DA55GMQPWOQFT6GHQEKZLOJP/graph.json","events_json":"https://pith.science/api/pith-number/H2DA55GMQPWOQFT6GHQEKZLOJP/events.json","paper":"https://pith.science/paper/H2DA55GM"},"agent_actions":{"view_html":"https://pith.science/pith/H2DA55GMQPWOQFT6GHQEKZLOJP","download_json":"https://pith.science/pith/H2DA55GMQPWOQFT6GHQEKZLOJP.json","view_paper":"https://pith.science/paper/H2DA55GM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0812.5101&json=true","fetch_graph":"https://pith.science/api/pith-number/H2DA55GMQPWOQFT6GHQEKZLOJP/graph.json","fetch_events":"https://pith.science/api/pith-number/H2DA55GMQPWOQFT6GHQEKZLOJP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H2DA55GMQPWOQFT6GHQEKZLOJP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H2DA55GMQPWOQFT6GHQEKZLOJP/action/storage_attestation","attest_author":"https://pith.science/pith/H2DA55GMQPWOQFT6GHQEKZLOJP/action/author_attestation","sign_citation":"https://pith.science/pith/H2DA55GMQPWOQFT6GHQEKZLOJP/action/citation_signature","submit_replication":"https://pith.science/pith/H2DA55GMQPWOQFT6GHQEKZLOJP/action/replication_record"}},"created_at":"2026-05-18T02:15:03.595492+00:00","updated_at":"2026-05-18T02:15:03.595492+00:00"}