{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6GQ2SLU5EMKBHWZQRDSLDW35XK","short_pith_number":"pith:6GQ2SLU5","canonical_record":{"source":{"id":"1801.09850","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-30T04:42:21Z","cross_cats_sorted":[],"title_canon_sha256":"df9c43310c5dd988cea7279a8ae89a796d99f1dcb9a974edff9b54fafc6a89b4","abstract_canon_sha256":"154c05e718134d6b4ae8144c0261c6147a7379965b1378b265bb5e17540232c8"},"schema_version":"1.0"},"canonical_sha256":"f1a1a92e9d231413db3088e4b1db7dba87b5c53844a77fd1b6e564b30cbdc2df","source":{"kind":"arxiv","id":"1801.09850","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09850","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09850v3","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09850","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"pith_short_12","alias_value":"6GQ2SLU5EMKB","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6GQ2SLU5EMKBHWZQ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6GQ2SLU5","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6GQ2SLU5EMKBHWZQRDSLDW35XK","target":"record","payload":{"canonical_record":{"source":{"id":"1801.09850","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-30T04:42:21Z","cross_cats_sorted":[],"title_canon_sha256":"df9c43310c5dd988cea7279a8ae89a796d99f1dcb9a974edff9b54fafc6a89b4","abstract_canon_sha256":"154c05e718134d6b4ae8144c0261c6147a7379965b1378b265bb5e17540232c8"},"schema_version":"1.0"},"canonical_sha256":"f1a1a92e9d231413db3088e4b1db7dba87b5c53844a77fd1b6e564b30cbdc2df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:22.753183Z","signature_b64":"q8ublFouTSbhNoQ1eUI4lBgo464/0mpwMJrrM1x8OvDhHV83x70VC+/zi2JsQGHfJftFbtfXvHpNvEjGymHPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1a1a92e9d231413db3088e4b1db7dba87b5c53844a77fd1b6e564b30cbdc2df","last_reissued_at":"2026-05-17T23:44:22.752581Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:22.752581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.09850","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-17T23:44:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WkJV8ffHw2UlmZa0vVvROFOkaxcvnDPkYzbgbrCNcw1cMUHSFpMB9//6UJ/yZDX05MzdbfnUpQn/GIEsd9MfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:01:28.950949Z"},"content_sha256":"7023710e92695d8442691cae22619dff793d80c023e8dfa74d222c83180d8217","schema_version":"1.0","event_id":"sha256:7023710e92695d8442691cae22619dff793d80c023e8dfa74d222c83180d8217"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6GQ2SLU5EMKBHWZQRDSLDW35XK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparsity in Max-Plus Algebra and Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anastasios Tsiamis, Petros Maragos","submitted_at":"2018-01-30T04:42:21Z","abstract_excerpt":"We study sparsity in the max-plus algebraic setting. We seek both exact and approximate solutions of the max-plus linear equation with minimum cardinality of support. In the former case, the sparsest solution problem is shown to be equivalent to the minimum set cover problem and, thus, NP-complete. In the latter one, the approximation is quantified by the $\\ell_{1}$ residual error norm, which is shown to have supermodular properties under some convex constraints, called lateness constraints. Thus, greedy approximation algorithms of polynomial complexity can be employed for both problems with g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09850","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-17T23:44:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8F3Vg6gsHjrIoFS4vD46fNIU0BNWAQ6aU4aR28/Tw+0emOyAWewPqq81wY+ubKgqpswLtf1TDXUHaZGtm9rLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:01:28.951633Z"},"content_sha256":"cb2da88ee48565109101ad3e91c148af3719c547f0e1028e9d55fb9e433fa88b","schema_version":"1.0","event_id":"sha256:cb2da88ee48565109101ad3e91c148af3719c547f0e1028e9d55fb9e433fa88b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6GQ2SLU5EMKBHWZQRDSLDW35XK/bundle.json","state_url":"https://pith.science/pith/6GQ2SLU5EMKBHWZQRDSLDW35XK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6GQ2SLU5EMKBHWZQRDSLDW35XK/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-24T21:01:28Z","links":{"resolver":"https://pith.science/pith/6GQ2SLU5EMKBHWZQRDSLDW35XK","bundle":"https://pith.science/pith/6GQ2SLU5EMKBHWZQRDSLDW35XK/bundle.json","state":"https://pith.science/pith/6GQ2SLU5EMKBHWZQRDSLDW35XK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6GQ2SLU5EMKBHWZQRDSLDW35XK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6GQ2SLU5EMKBHWZQRDSLDW35XK","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":"154c05e718134d6b4ae8144c0261c6147a7379965b1378b265bb5e17540232c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-30T04:42:21Z","title_canon_sha256":"df9c43310c5dd988cea7279a8ae89a796d99f1dcb9a974edff9b54fafc6a89b4"},"schema_version":"1.0","source":{"id":"1801.09850","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09850","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09850v3","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09850","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"pith_short_12","alias_value":"6GQ2SLU5EMKB","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6GQ2SLU5EMKBHWZQ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6GQ2SLU5","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:cb2da88ee48565109101ad3e91c148af3719c547f0e1028e9d55fb9e433fa88b","target":"graph","created_at":"2026-05-17T23:44:22Z","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 study sparsity in the max-plus algebraic setting. We seek both exact and approximate solutions of the max-plus linear equation with minimum cardinality of support. In the former case, the sparsest solution problem is shown to be equivalent to the minimum set cover problem and, thus, NP-complete. In the latter one, the approximation is quantified by the $\\ell_{1}$ residual error norm, which is shown to have supermodular properties under some convex constraints, called lateness constraints. Thus, greedy approximation algorithms of polynomial complexity can be employed for both problems with g","authors_text":"Anastasios Tsiamis, Petros Maragos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-30T04:42:21Z","title":"Sparsity in Max-Plus Algebra and Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09850","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:7023710e92695d8442691cae22619dff793d80c023e8dfa74d222c83180d8217","target":"record","created_at":"2026-05-17T23:44:22Z","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":"154c05e718134d6b4ae8144c0261c6147a7379965b1378b265bb5e17540232c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-30T04:42:21Z","title_canon_sha256":"df9c43310c5dd988cea7279a8ae89a796d99f1dcb9a974edff9b54fafc6a89b4"},"schema_version":"1.0","source":{"id":"1801.09850","kind":"arxiv","version":3}},"canonical_sha256":"f1a1a92e9d231413db3088e4b1db7dba87b5c53844a77fd1b6e564b30cbdc2df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1a1a92e9d231413db3088e4b1db7dba87b5c53844a77fd1b6e564b30cbdc2df","first_computed_at":"2026-05-17T23:44:22.752581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:22.752581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q8ublFouTSbhNoQ1eUI4lBgo464/0mpwMJrrM1x8OvDhHV83x70VC+/zi2JsQGHfJftFbtfXvHpNvEjGymHPAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:22.753183Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.09850","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7023710e92695d8442691cae22619dff793d80c023e8dfa74d222c83180d8217","sha256:cb2da88ee48565109101ad3e91c148af3719c547f0e1028e9d55fb9e433fa88b"],"state_sha256":"f4b06c762074e7aac07ff1b305fd7a8e36dfc4f325dbccad2f8973d5363b2ad4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8pScHk5TLMi4wI/dGgzQCtjy+7gpR58a/quO5dMjmkYbLa7aeHJTxdwk9D/IH63N06sp8yp+qC4nvd14zyA+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T21:01:28.954661Z","bundle_sha256":"ea485d7c8193dbd715789901abc361c45edf21c69f8b2121470e19f3181fa8ac"}}