{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:DS6TFDRYCQMHJGR2ROLJCHZZBI","short_pith_number":"pith:DS6TFDRY","schema_version":"1.0","canonical_sha256":"1cbd328e381418749a3a8b96911f390a203d962320420647ef6eb7954833a9fe","source":{"kind":"arxiv","id":"2106.00357","version":1},"attestation_state":"computed","paper":{"title":"Experiments with graph convolutional networks for solving the vertex $p$-center problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Elisabeth Gaar, Markus Sinnl","submitted_at":"2021-06-01T10:06:31Z","abstract_excerpt":"In the last few years, graph convolutional networks (GCN) have become a popular research direction in the machine learning community to tackle NP-hard combinatorial optimization problems (COPs) defined on graphs. While the obtained results are usually still not competitive with problem-specific solution approaches from the operations research community, GCNs often lead to improvements compared to previous machine learning approaches for classical COPs such as the traveling salesperson problem (TSP).\n  In this work we present a preliminary study on using GCNs for solving the vertex p-center pro"},"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":"2106.00357","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-06-01T10:06:31Z","cross_cats_sorted":[],"title_canon_sha256":"a15c3ad871deaf2921fb2ef64f13288941ae91d6b867ee129cdab12b67eceb27","abstract_canon_sha256":"7f763f5fb2a51b9761ae6eb005c793586d06a28858f476e9634c24fec453a1a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:45:03.820613Z","signature_b64":"DJdgI2XzMKfsrkXv5geZraoxikCrdveCdYp4CPebe1xSh64qF3tVfpjeRIYXKgL83HKn9u1uStWkQT0XgiicAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cbd328e381418749a3a8b96911f390a203d962320420647ef6eb7954833a9fe","last_reissued_at":"2026-07-05T02:45:03.820216Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:45:03.820216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Experiments with graph convolutional networks for solving the vertex $p$-center problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Elisabeth Gaar, Markus Sinnl","submitted_at":"2021-06-01T10:06:31Z","abstract_excerpt":"In the last few years, graph convolutional networks (GCN) have become a popular research direction in the machine learning community to tackle NP-hard combinatorial optimization problems (COPs) defined on graphs. While the obtained results are usually still not competitive with problem-specific solution approaches from the operations research community, GCNs often lead to improvements compared to previous machine learning approaches for classical COPs such as the traveling salesperson problem (TSP).\n  In this work we present a preliminary study on using GCNs for solving the vertex p-center pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.00357","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.00357/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2106.00357","created_at":"2026-07-05T02:45:03.820276+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.00357v1","created_at":"2026-07-05T02:45:03.820276+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.00357","created_at":"2026-07-05T02:45:03.820276+00:00"},{"alias_kind":"pith_short_12","alias_value":"DS6TFDRYCQMH","created_at":"2026-07-05T02:45:03.820276+00:00"},{"alias_kind":"pith_short_16","alias_value":"DS6TFDRYCQMHJGR2","created_at":"2026-07-05T02:45:03.820276+00:00"},{"alias_kind":"pith_short_8","alias_value":"DS6TFDRY","created_at":"2026-07-05T02:45:03.820276+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/DS6TFDRYCQMHJGR2ROLJCHZZBI","json":"https://pith.science/pith/DS6TFDRYCQMHJGR2ROLJCHZZBI.json","graph_json":"https://pith.science/api/pith-number/DS6TFDRYCQMHJGR2ROLJCHZZBI/graph.json","events_json":"https://pith.science/api/pith-number/DS6TFDRYCQMHJGR2ROLJCHZZBI/events.json","paper":"https://pith.science/paper/DS6TFDRY"},"agent_actions":{"view_html":"https://pith.science/pith/DS6TFDRYCQMHJGR2ROLJCHZZBI","download_json":"https://pith.science/pith/DS6TFDRYCQMHJGR2ROLJCHZZBI.json","view_paper":"https://pith.science/paper/DS6TFDRY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.00357&json=true","fetch_graph":"https://pith.science/api/pith-number/DS6TFDRYCQMHJGR2ROLJCHZZBI/graph.json","fetch_events":"https://pith.science/api/pith-number/DS6TFDRYCQMHJGR2ROLJCHZZBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DS6TFDRYCQMHJGR2ROLJCHZZBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DS6TFDRYCQMHJGR2ROLJCHZZBI/action/storage_attestation","attest_author":"https://pith.science/pith/DS6TFDRYCQMHJGR2ROLJCHZZBI/action/author_attestation","sign_citation":"https://pith.science/pith/DS6TFDRYCQMHJGR2ROLJCHZZBI/action/citation_signature","submit_replication":"https://pith.science/pith/DS6TFDRYCQMHJGR2ROLJCHZZBI/action/replication_record"}},"created_at":"2026-07-05T02:45:03.820276+00:00","updated_at":"2026-07-05T02:45:03.820276+00:00"}