{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RB4RHODU73OVIZ4YK42ZBRZS2U","short_pith_number":"pith:RB4RHODU","schema_version":"1.0","canonical_sha256":"887913b874fedd546798573590c732d53c504d360cd99427e2b6cb5b0edaa22b","source":{"kind":"arxiv","id":"1909.04463","version":2},"attestation_state":"computed","paper":{"title":"Algorithmic expedients for the S-labeling problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Markus Sinnl","submitted_at":"2019-09-10T13:17:17Z","abstract_excerpt":"Graph labeling problems have been widely studied in the last decades and have a vast area of application. In this work, we study the recently introduced S-labeling problem, in which the nodes get labeled using labels from 1 to |V | and for each edge the contribution to the objective function, called S-labeling number of the graph, is the minimum label of its end-nodes. The goal is to find a labeling with minimum value. The problem is NP-hard for planar subcubic graphs, although for many other graph classes the complexity status is still unknown. In this paper, we present different algorithmic "},"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":"1909.04463","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-10T13:17:17Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c352e52e6a0acad4245f7f98b4eb507c12a115df1acc6a9db07d3928a29efba9","abstract_canon_sha256":"16063b6203208053846d08b864c14ec2a179a028c532a23da89f0716e16ed22d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:03:59.136509Z","signature_b64":"RHJAofFu1+Nf/Mep+lkgXIITo18ZzwRSetCCbd75f85T2u85nKp4EEghAlyDMg7IkSodsIVdAa4Qku9gGMyTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"887913b874fedd546798573590c732d53c504d360cd99427e2b6cb5b0edaa22b","last_reissued_at":"2026-07-05T00:03:59.135926Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:03:59.135926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic expedients for the S-labeling problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Markus Sinnl","submitted_at":"2019-09-10T13:17:17Z","abstract_excerpt":"Graph labeling problems have been widely studied in the last decades and have a vast area of application. In this work, we study the recently introduced S-labeling problem, in which the nodes get labeled using labels from 1 to |V | and for each edge the contribution to the objective function, called S-labeling number of the graph, is the minimum label of its end-nodes. The goal is to find a labeling with minimum value. The problem is NP-hard for planar subcubic graphs, although for many other graph classes the complexity status is still unknown. In this paper, we present different algorithmic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.04463","kind":"arxiv","version":2},"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/1909.04463/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":"1909.04463","created_at":"2026-07-05T00:03:59.135989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.04463v2","created_at":"2026-07-05T00:03:59.135989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.04463","created_at":"2026-07-05T00:03:59.135989+00:00"},{"alias_kind":"pith_short_12","alias_value":"RB4RHODU73OV","created_at":"2026-07-05T00:03:59.135989+00:00"},{"alias_kind":"pith_short_16","alias_value":"RB4RHODU73OVIZ4Y","created_at":"2026-07-05T00:03:59.135989+00:00"},{"alias_kind":"pith_short_8","alias_value":"RB4RHODU","created_at":"2026-07-05T00:03:59.135989+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/RB4RHODU73OVIZ4YK42ZBRZS2U","json":"https://pith.science/pith/RB4RHODU73OVIZ4YK42ZBRZS2U.json","graph_json":"https://pith.science/api/pith-number/RB4RHODU73OVIZ4YK42ZBRZS2U/graph.json","events_json":"https://pith.science/api/pith-number/RB4RHODU73OVIZ4YK42ZBRZS2U/events.json","paper":"https://pith.science/paper/RB4RHODU"},"agent_actions":{"view_html":"https://pith.science/pith/RB4RHODU73OVIZ4YK42ZBRZS2U","download_json":"https://pith.science/pith/RB4RHODU73OVIZ4YK42ZBRZS2U.json","view_paper":"https://pith.science/paper/RB4RHODU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.04463&json=true","fetch_graph":"https://pith.science/api/pith-number/RB4RHODU73OVIZ4YK42ZBRZS2U/graph.json","fetch_events":"https://pith.science/api/pith-number/RB4RHODU73OVIZ4YK42ZBRZS2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RB4RHODU73OVIZ4YK42ZBRZS2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RB4RHODU73OVIZ4YK42ZBRZS2U/action/storage_attestation","attest_author":"https://pith.science/pith/RB4RHODU73OVIZ4YK42ZBRZS2U/action/author_attestation","sign_citation":"https://pith.science/pith/RB4RHODU73OVIZ4YK42ZBRZS2U/action/citation_signature","submit_replication":"https://pith.science/pith/RB4RHODU73OVIZ4YK42ZBRZS2U/action/replication_record"}},"created_at":"2026-07-05T00:03:59.135989+00:00","updated_at":"2026-07-05T00:03:59.135989+00:00"}