{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NR2QR5Y4VD5UHMPMVUT4RLFITS","short_pith_number":"pith:NR2QR5Y4","schema_version":"1.0","canonical_sha256":"6c7508f71ca8fb43b1ecad27c8aca89cb82b50489c67fc814e9a993104210e11","source":{"kind":"arxiv","id":"1102.3030","version":3},"attestation_state":"computed","paper":{"title":"The Wiener maximum quadratic assignment problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Eranda \\c{C}ela, Gerhard J. Woeginger, Nina S. Schmuck, Shmuel Wimer","submitted_at":"2011-02-15T10:37:08Z","abstract_excerpt":"We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional point set. We show that this special case, which we call the Wiener maximum quadratic assignment problem, is NP-hard in the ordinary sense and solvable in pseudo-polynomial time. Our approach also yields a polynomial time solution for the following problem from chemical graph theory: Find a tree that maximizes the Wiener index among all trees with a prescribed degree sequence. This settles an open problem from the litera"},"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":"1102.3030","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-02-15T10:37:08Z","cross_cats_sorted":[],"title_canon_sha256":"a54de8eff9c581bf19d79e264838b8f92e2d759d400cdb750da70a415c98d525","abstract_canon_sha256":"c988e87400d67110d992453547ce524f9b877ab2af337dedff10325a37dfe7b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:47.707715Z","signature_b64":"H23pu4w6hIn6wn4P87B9RDYa+PhJks0jbE/3hqLJcR+gDH8OCwhKx0WP1PZuhZ8KypQtuMFAS57vbVnSR3I3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c7508f71ca8fb43b1ecad27c8aca89cb82b50489c67fc814e9a993104210e11","last_reissued_at":"2026-05-18T04:23:47.707068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:47.707068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Wiener maximum quadratic assignment problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Eranda \\c{C}ela, Gerhard J. Woeginger, Nina S. Schmuck, Shmuel Wimer","submitted_at":"2011-02-15T10:37:08Z","abstract_excerpt":"We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional point set. We show that this special case, which we call the Wiener maximum quadratic assignment problem, is NP-hard in the ordinary sense and solvable in pseudo-polynomial time. Our approach also yields a polynomial time solution for the following problem from chemical graph theory: Find a tree that maximizes the Wiener index among all trees with a prescribed degree sequence. This settles an open problem from the litera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3030","kind":"arxiv","version":3},"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":"1102.3030","created_at":"2026-05-18T04:23:47.707137+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.3030v3","created_at":"2026-05-18T04:23:47.707137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3030","created_at":"2026-05-18T04:23:47.707137+00:00"},{"alias_kind":"pith_short_12","alias_value":"NR2QR5Y4VD5U","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NR2QR5Y4VD5UHMPM","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NR2QR5Y4","created_at":"2026-05-18T12:26:37.096874+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/NR2QR5Y4VD5UHMPMVUT4RLFITS","json":"https://pith.science/pith/NR2QR5Y4VD5UHMPMVUT4RLFITS.json","graph_json":"https://pith.science/api/pith-number/NR2QR5Y4VD5UHMPMVUT4RLFITS/graph.json","events_json":"https://pith.science/api/pith-number/NR2QR5Y4VD5UHMPMVUT4RLFITS/events.json","paper":"https://pith.science/paper/NR2QR5Y4"},"agent_actions":{"view_html":"https://pith.science/pith/NR2QR5Y4VD5UHMPMVUT4RLFITS","download_json":"https://pith.science/pith/NR2QR5Y4VD5UHMPMVUT4RLFITS.json","view_paper":"https://pith.science/paper/NR2QR5Y4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.3030&json=true","fetch_graph":"https://pith.science/api/pith-number/NR2QR5Y4VD5UHMPMVUT4RLFITS/graph.json","fetch_events":"https://pith.science/api/pith-number/NR2QR5Y4VD5UHMPMVUT4RLFITS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NR2QR5Y4VD5UHMPMVUT4RLFITS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NR2QR5Y4VD5UHMPMVUT4RLFITS/action/storage_attestation","attest_author":"https://pith.science/pith/NR2QR5Y4VD5UHMPMVUT4RLFITS/action/author_attestation","sign_citation":"https://pith.science/pith/NR2QR5Y4VD5UHMPMVUT4RLFITS/action/citation_signature","submit_replication":"https://pith.science/pith/NR2QR5Y4VD5UHMPMVUT4RLFITS/action/replication_record"}},"created_at":"2026-05-18T04:23:47.707137+00:00","updated_at":"2026-05-18T04:23:47.707137+00:00"}