{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Q6J4QWDO4NJ3AHFSHIP5ZX76WL","short_pith_number":"pith:Q6J4QWDO","canonical_record":{"source":{"id":"1408.4389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-19T16:43:49Z","cross_cats_sorted":["cs.NA","math.OC"],"title_canon_sha256":"fd9a234dad162dbe7de64736fe6305d2f30d53ffb9f331946f8a06d725cdfc8e","abstract_canon_sha256":"5c7cf41b3fd18daed77b94e9a83424065b8a17a69c479af1640947ba15ca5e64"},"schema_version":"1.0"},"canonical_sha256":"8793c8586ee353b01cb23a1fdcdffeb2cc8304fdb2167fb78b2bacd4d2c8ce25","source":{"kind":"arxiv","id":"1408.4389","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4389","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4389v2","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4389","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"Q6J4QWDO4NJ3","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q6J4QWDO4NJ3AHFS","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q6J4QWDO","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Q6J4QWDO4NJ3AHFSHIP5ZX76WL","target":"record","payload":{"canonical_record":{"source":{"id":"1408.4389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-19T16:43:49Z","cross_cats_sorted":["cs.NA","math.OC"],"title_canon_sha256":"fd9a234dad162dbe7de64736fe6305d2f30d53ffb9f331946f8a06d725cdfc8e","abstract_canon_sha256":"5c7cf41b3fd18daed77b94e9a83424065b8a17a69c479af1640947ba15ca5e64"},"schema_version":"1.0"},"canonical_sha256":"8793c8586ee353b01cb23a1fdcdffeb2cc8304fdb2167fb78b2bacd4d2c8ce25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:44.361132Z","signature_b64":"wv8+2lP1cFpYDhK4lnMOdvRKjjRFCNEYqhfwF/IoDwSeb4JBmeIyk/y1wPG75y6GmrY1Eka0sfhlfIfkr5qwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8793c8586ee353b01cb23a1fdcdffeb2cc8304fdb2167fb78b2bacd4d2c8ce25","last_reissued_at":"2026-05-18T02:37:44.360704Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:44.360704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.4389","source_version":2,"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-18T02:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b2Ao2Xagt5jqgE3zGG95yVvJ/ohhB0lYjkFdf53K/FqFZs9tx38XGoJXZJnyN85IDOmc8od5eEZKtDnGSW1tAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:07:11.651223Z"},"content_sha256":"34f83849012b9a796b0dec080e075fb977603c5e65584a8cf0be84d38251d346","schema_version":"1.0","event_id":"sha256:34f83849012b9a796b0dec080e075fb977603c5e65584a8cf0be84d38251d346"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Q6J4QWDO4NJ3AHFSHIP5ZX76WL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Unconstrained Quasi-Submodular Function Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"cs.DS","authors_text":"Bao-Liang Lu, Jincheng Mei, Kang Zhao","submitted_at":"2014-08-19T16:43:49Z","abstract_excerpt":"With the extensive application of submodularity, its generalizations are constantly being proposed. However, most of them are tailored for special problems. In this paper, we focus on quasi-submodularity, a universal generalization, which satisfies weaker properties than submodularity but still enjoys favorable performance in optimization. Similar to the diminishing return property of submodularity, we first define a corresponding property called the {\\em single sub-crossing}, then we propose two algorithms for unconstrained quasi-submodular function minimization and maximization, respectively"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4389","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":""},"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-18T02:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mb/45QOigaIpqwkAfnY3M8/+Zc2iXZxGRwaCi7J/O1MgSwy0t7GBh5ORnceJu6p7pazHDbfDZU/w2j8xYJP0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:07:11.651955Z"},"content_sha256":"90d589561a2ee24f51a31a00b56b59256cf35e60db272372f48bb6d549f396b2","schema_version":"1.0","event_id":"sha256:90d589561a2ee24f51a31a00b56b59256cf35e60db272372f48bb6d549f396b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q6J4QWDO4NJ3AHFSHIP5ZX76WL/bundle.json","state_url":"https://pith.science/pith/Q6J4QWDO4NJ3AHFSHIP5ZX76WL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q6J4QWDO4NJ3AHFSHIP5ZX76WL/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-08T19:07:11Z","links":{"resolver":"https://pith.science/pith/Q6J4QWDO4NJ3AHFSHIP5ZX76WL","bundle":"https://pith.science/pith/Q6J4QWDO4NJ3AHFSHIP5ZX76WL/bundle.json","state":"https://pith.science/pith/Q6J4QWDO4NJ3AHFSHIP5ZX76WL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q6J4QWDO4NJ3AHFSHIP5ZX76WL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Q6J4QWDO4NJ3AHFSHIP5ZX76WL","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":"5c7cf41b3fd18daed77b94e9a83424065b8a17a69c479af1640947ba15ca5e64","cross_cats_sorted":["cs.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-19T16:43:49Z","title_canon_sha256":"fd9a234dad162dbe7de64736fe6305d2f30d53ffb9f331946f8a06d725cdfc8e"},"schema_version":"1.0","source":{"id":"1408.4389","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4389","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4389v2","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4389","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"Q6J4QWDO4NJ3","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q6J4QWDO4NJ3AHFS","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q6J4QWDO","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:90d589561a2ee24f51a31a00b56b59256cf35e60db272372f48bb6d549f396b2","target":"graph","created_at":"2026-05-18T02:37:44Z","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":"With the extensive application of submodularity, its generalizations are constantly being proposed. However, most of them are tailored for special problems. In this paper, we focus on quasi-submodularity, a universal generalization, which satisfies weaker properties than submodularity but still enjoys favorable performance in optimization. Similar to the diminishing return property of submodularity, we first define a corresponding property called the {\\em single sub-crossing}, then we propose two algorithms for unconstrained quasi-submodular function minimization and maximization, respectively","authors_text":"Bao-Liang Lu, Jincheng Mei, Kang Zhao","cross_cats":["cs.NA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-19T16:43:49Z","title":"On Unconstrained Quasi-Submodular Function Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4389","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:34f83849012b9a796b0dec080e075fb977603c5e65584a8cf0be84d38251d346","target":"record","created_at":"2026-05-18T02:37:44Z","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":"5c7cf41b3fd18daed77b94e9a83424065b8a17a69c479af1640947ba15ca5e64","cross_cats_sorted":["cs.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-19T16:43:49Z","title_canon_sha256":"fd9a234dad162dbe7de64736fe6305d2f30d53ffb9f331946f8a06d725cdfc8e"},"schema_version":"1.0","source":{"id":"1408.4389","kind":"arxiv","version":2}},"canonical_sha256":"8793c8586ee353b01cb23a1fdcdffeb2cc8304fdb2167fb78b2bacd4d2c8ce25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8793c8586ee353b01cb23a1fdcdffeb2cc8304fdb2167fb78b2bacd4d2c8ce25","first_computed_at":"2026-05-18T02:37:44.360704Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:44.360704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wv8+2lP1cFpYDhK4lnMOdvRKjjRFCNEYqhfwF/IoDwSeb4JBmeIyk/y1wPG75y6GmrY1Eka0sfhlfIfkr5qwBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:44.361132Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.4389","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34f83849012b9a796b0dec080e075fb977603c5e65584a8cf0be84d38251d346","sha256:90d589561a2ee24f51a31a00b56b59256cf35e60db272372f48bb6d549f396b2"],"state_sha256":"3a36f5ddc7bb0064ddf14c7078a6776384adf756491cb83bd6daeb9c0af994cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eZAji31nZYly1LH/6c2FpPDOpxaLBmrLbMKFqYZ9MynrnO1gmkQp6UWGlhkW6aFhPj7GmZt8tzILeLwkpU87CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:07:11.656111Z","bundle_sha256":"6b6f4bcdb5c118ce9c918cab90bc2f52ff1728cc9c4c6a68549c9b7c480b1c0c"}}