{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NR2QR5Y4VD5UHMPMVUT4RLFITS","short_pith_number":"pith:NR2QR5Y4","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"},"canonical_sha256":"6c7508f71ca8fb43b1ecad27c8aca89cb82b50489c67fc814e9a993104210e11","source":{"kind":"arxiv","id":"1102.3030","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3030","created_at":"2026-05-18T04:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3030v3","created_at":"2026-05-18T04:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3030","created_at":"2026-05-18T04:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"NR2QR5Y4VD5U","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NR2QR5Y4VD5UHMPM","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NR2QR5Y4","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NR2QR5Y4VD5UHMPMVUT4RLFITS","target":"record","payload":{"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"},"canonical_sha256":"6c7508f71ca8fb43b1ecad27c8aca89cb82b50489c67fc814e9a993104210e11","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"},"source_kind":"arxiv","source_id":"1102.3030","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qs+k5YxbH69U1/u516g+tIw9P049lTGO2Sr6o9KgT7aBVuYby8NbeqFkAuCk8TPIT1stcZja8KmVHrgTBE0qAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:57:09.461083Z"},"content_sha256":"f2af94ba0a10e9985af73a9191c85f2f25ca599ccca5e948e5b9f89cb20c6c4b","schema_version":"1.0","event_id":"sha256:f2af94ba0a10e9985af73a9191c85f2f25ca599ccca5e948e5b9f89cb20c6c4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NR2QR5Y4VD5UHMPMVUT4RLFITS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RU26HpjPzXIFjWeSJ0J1b6zTIiu+dtcyBxM4gzgdbNehc5L8Sgk4RnpocTYsnRcerE2ngqWPn24xHLW0LbuXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:57:09.461751Z"},"content_sha256":"9ea665bc7c2a043caf74725d0e82282712fe1d72932f9f46f3884ee7fb8085a8","schema_version":"1.0","event_id":"sha256:9ea665bc7c2a043caf74725d0e82282712fe1d72932f9f46f3884ee7fb8085a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NR2QR5Y4VD5UHMPMVUT4RLFITS/bundle.json","state_url":"https://pith.science/pith/NR2QR5Y4VD5UHMPMVUT4RLFITS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NR2QR5Y4VD5UHMPMVUT4RLFITS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T02:57:09Z","links":{"resolver":"https://pith.science/pith/NR2QR5Y4VD5UHMPMVUT4RLFITS","bundle":"https://pith.science/pith/NR2QR5Y4VD5UHMPMVUT4RLFITS/bundle.json","state":"https://pith.science/pith/NR2QR5Y4VD5UHMPMVUT4RLFITS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NR2QR5Y4VD5UHMPMVUT4RLFITS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NR2QR5Y4VD5UHMPMVUT4RLFITS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c988e87400d67110d992453547ce524f9b877ab2af337dedff10325a37dfe7b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-02-15T10:37:08Z","title_canon_sha256":"a54de8eff9c581bf19d79e264838b8f92e2d759d400cdb750da70a415c98d525"},"schema_version":"1.0","source":{"id":"1102.3030","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3030","created_at":"2026-05-18T04:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3030v3","created_at":"2026-05-18T04:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3030","created_at":"2026-05-18T04:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"NR2QR5Y4VD5U","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NR2QR5Y4VD5UHMPM","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NR2QR5Y4","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:9ea665bc7c2a043caf74725d0e82282712fe1d72932f9f46f3884ee7fb8085a8","target":"graph","created_at":"2026-05-18T04:23:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Eranda \\c{C}ela, Gerhard J. Woeginger, Nina S. Schmuck, Shmuel Wimer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-02-15T10:37:08Z","title":"The Wiener maximum quadratic assignment problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3030","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f2af94ba0a10e9985af73a9191c85f2f25ca599ccca5e948e5b9f89cb20c6c4b","target":"record","created_at":"2026-05-18T04:23:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c988e87400d67110d992453547ce524f9b877ab2af337dedff10325a37dfe7b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-02-15T10:37:08Z","title_canon_sha256":"a54de8eff9c581bf19d79e264838b8f92e2d759d400cdb750da70a415c98d525"},"schema_version":"1.0","source":{"id":"1102.3030","kind":"arxiv","version":3}},"canonical_sha256":"6c7508f71ca8fb43b1ecad27c8aca89cb82b50489c67fc814e9a993104210e11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c7508f71ca8fb43b1ecad27c8aca89cb82b50489c67fc814e9a993104210e11","first_computed_at":"2026-05-18T04:23:47.707068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:47.707068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H23pu4w6hIn6wn4P87B9RDYa+PhJks0jbE/3hqLJcR+gDH8OCwhKx0WP1PZuhZ8KypQtuMFAS57vbVnSR3I3Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:47.707715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3030","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2af94ba0a10e9985af73a9191c85f2f25ca599ccca5e948e5b9f89cb20c6c4b","sha256:9ea665bc7c2a043caf74725d0e82282712fe1d72932f9f46f3884ee7fb8085a8"],"state_sha256":"9eb651bea5da26bd99ec74d0e1b42e662584b4444ef8a739c425fd8be5634ed4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mh/vDBPPkBF5sh2PLFT7n06QbUiUVTp7GSB+QKTzbAfBXvPhSX8GxfwYNuz6UQqK5+YPvhwL3TKy1dt5FI0pAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T02:57:09.464790Z","bundle_sha256":"53699fd20011f35b17eebe251132ec6219ce26635f1a256e945e407c925254ea"}}