{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RB4RHODU73OVIZ4YK42ZBRZS2U","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":"16063b6203208053846d08b864c14ec2a179a028c532a23da89f0716e16ed22d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-10T13:17:17Z","title_canon_sha256":"c352e52e6a0acad4245f7f98b4eb507c12a115df1acc6a9db07d3928a29efba9"},"schema_version":"1.0","source":{"id":"1909.04463","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.04463","created_at":"2026-07-05T00:03:59Z"},{"alias_kind":"arxiv_version","alias_value":"1909.04463v2","created_at":"2026-07-05T00:03:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.04463","created_at":"2026-07-05T00:03:59Z"},{"alias_kind":"pith_short_12","alias_value":"RB4RHODU73OV","created_at":"2026-07-05T00:03:59Z"},{"alias_kind":"pith_short_16","alias_value":"RB4RHODU73OVIZ4Y","created_at":"2026-07-05T00:03:59Z"},{"alias_kind":"pith_short_8","alias_value":"RB4RHODU","created_at":"2026-07-05T00:03:59Z"}],"graph_snapshots":[{"event_id":"sha256:a4c2740594a1e00b4a7c70bb2eda901158a8633b6d7bef2d331811e84e51a41c","target":"graph","created_at":"2026-07-05T00:03:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.04463/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Markus Sinnl","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-10T13:17:17Z","title":"Algorithmic expedients for the S-labeling problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.04463","kind":"arxiv","version":2},"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:024f6dfe1a08ba590a82b06c9b1c0f9e0a04611b368c7697c6bc417eb6eb8fb3","target":"record","created_at":"2026-07-05T00:03:59Z","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":"16063b6203208053846d08b864c14ec2a179a028c532a23da89f0716e16ed22d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-10T13:17:17Z","title_canon_sha256":"c352e52e6a0acad4245f7f98b4eb507c12a115df1acc6a9db07d3928a29efba9"},"schema_version":"1.0","source":{"id":"1909.04463","kind":"arxiv","version":2}},"canonical_sha256":"887913b874fedd546798573590c732d53c504d360cd99427e2b6cb5b0edaa22b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"887913b874fedd546798573590c732d53c504d360cd99427e2b6cb5b0edaa22b","first_computed_at":"2026-07-05T00:03:59.135926Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:03:59.135926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RHJAofFu1+Nf/Mep+lkgXIITo18ZzwRSetCCbd75f85T2u85nKp4EEghAlyDMg7IkSodsIVdAa4Qku9gGMyTDg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:03:59.136509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.04463","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:024f6dfe1a08ba590a82b06c9b1c0f9e0a04611b368c7697c6bc417eb6eb8fb3","sha256:a4c2740594a1e00b4a7c70bb2eda901158a8633b6d7bef2d331811e84e51a41c"],"state_sha256":"327dd202a0b75be3ff9cd457e4a7b229372efaae573874fdd0b93bcfbd73b443"}