{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3XAXZT72KBCC5UP3GYSDRMR7GT","short_pith_number":"pith:3XAXZT72","schema_version":"1.0","canonical_sha256":"ddc17ccffa50442ed1fb362438b23f34fd9256789be0fe5588bd6aff5844bec5","source":{"kind":"arxiv","id":"1610.02469","version":1},"attestation_state":"computed","paper":{"title":"L-convexity on graph structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.OC","authors_text":"Hiroshi Hirai","submitted_at":"2016-10-08T03:02:55Z","abstract_excerpt":"In this paper, we study classes of discrete convex functions: submodular functions on modular semilattices and L-convex functions on oriented modular graphs. They were introduced by the author in complexity classification of minimum 0-extension problems. We clarify the relationship to other discrete convex functions, such as $k$-submodular functions, skew-bisubmodular functions, L$^\\natural$-convex functions, tree submodular functions, and UJ-convex functions. We show that they are actually viewed as submodular/L-convex functions in our sense. We also prove a sharp iteration bound of the steep"},"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":"1610.02469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-08T03:02:55Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"88d1303e0c625e1753c3ae16adeff1e668b9303369a61df152067a92a8de2d50","abstract_canon_sha256":"88ff914d89da5129145b5a87468efec00467317ced3065614f5bfa7812b9c47f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:51.437192Z","signature_b64":"JfAxzCgF6z+njfEyB81vawjPZrNME3OW1/Wp0agTjauPsAR3RK/sesuLCf08ID2Pwo2Dvatj6PCBfenNm297BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddc17ccffa50442ed1fb362438b23f34fd9256789be0fe5588bd6aff5844bec5","last_reissued_at":"2026-05-18T01:02:51.436828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:51.436828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"L-convexity on graph structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.OC","authors_text":"Hiroshi Hirai","submitted_at":"2016-10-08T03:02:55Z","abstract_excerpt":"In this paper, we study classes of discrete convex functions: submodular functions on modular semilattices and L-convex functions on oriented modular graphs. They were introduced by the author in complexity classification of minimum 0-extension problems. We clarify the relationship to other discrete convex functions, such as $k$-submodular functions, skew-bisubmodular functions, L$^\\natural$-convex functions, tree submodular functions, and UJ-convex functions. We show that they are actually viewed as submodular/L-convex functions in our sense. We also prove a sharp iteration bound of the steep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02469","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":""},"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":"1610.02469","created_at":"2026-05-18T01:02:51.436891+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.02469v1","created_at":"2026-05-18T01:02:51.436891+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02469","created_at":"2026-05-18T01:02:51.436891+00:00"},{"alias_kind":"pith_short_12","alias_value":"3XAXZT72KBCC","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"3XAXZT72KBCC5UP3","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"3XAXZT72","created_at":"2026-05-18T12:29:58.707656+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/3XAXZT72KBCC5UP3GYSDRMR7GT","json":"https://pith.science/pith/3XAXZT72KBCC5UP3GYSDRMR7GT.json","graph_json":"https://pith.science/api/pith-number/3XAXZT72KBCC5UP3GYSDRMR7GT/graph.json","events_json":"https://pith.science/api/pith-number/3XAXZT72KBCC5UP3GYSDRMR7GT/events.json","paper":"https://pith.science/paper/3XAXZT72"},"agent_actions":{"view_html":"https://pith.science/pith/3XAXZT72KBCC5UP3GYSDRMR7GT","download_json":"https://pith.science/pith/3XAXZT72KBCC5UP3GYSDRMR7GT.json","view_paper":"https://pith.science/paper/3XAXZT72","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.02469&json=true","fetch_graph":"https://pith.science/api/pith-number/3XAXZT72KBCC5UP3GYSDRMR7GT/graph.json","fetch_events":"https://pith.science/api/pith-number/3XAXZT72KBCC5UP3GYSDRMR7GT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3XAXZT72KBCC5UP3GYSDRMR7GT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3XAXZT72KBCC5UP3GYSDRMR7GT/action/storage_attestation","attest_author":"https://pith.science/pith/3XAXZT72KBCC5UP3GYSDRMR7GT/action/author_attestation","sign_citation":"https://pith.science/pith/3XAXZT72KBCC5UP3GYSDRMR7GT/action/citation_signature","submit_replication":"https://pith.science/pith/3XAXZT72KBCC5UP3GYSDRMR7GT/action/replication_record"}},"created_at":"2026-05-18T01:02:51.436891+00:00","updated_at":"2026-05-18T01:02:51.436891+00:00"}