{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2003:ZWTCQ5DXHQUEW2ZINRKA2GN5TD","short_pith_number":"pith:ZWTCQ5DX","canonical_record":{"source":{"id":"math/0312086","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2003-12-03T15:25:30Z","cross_cats_sorted":[],"title_canon_sha256":"4f4b2d5ac0cccc2348763defc87a6d366496c6d02b22fd2fd4f87e5a626c83f0","abstract_canon_sha256":"e8fbbf03b065060c79ff7f93ce2f589b27476d499fd055e388a9d9a7e3d58d5a"},"schema_version":"1.0"},"canonical_sha256":"cda62874773c284b6b286c540d19bd98c1c2a2f0c3ba3e94a938358dbc0907f3","source":{"kind":"arxiv","id":"math/0312086","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0312086","created_at":"2026-07-04T14:38:03Z"},{"alias_kind":"arxiv_version","alias_value":"math/0312086v2","created_at":"2026-07-04T14:38:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0312086","created_at":"2026-07-04T14:38:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZWTCQ5DXHQUE","created_at":"2026-07-04T14:38:03Z"},{"alias_kind":"pith_short_16","alias_value":"ZWTCQ5DXHQUEW2ZI","created_at":"2026-07-04T14:38:03Z"},{"alias_kind":"pith_short_8","alias_value":"ZWTCQ5DX","created_at":"2026-07-04T14:38:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2003:ZWTCQ5DXHQUEW2ZINRKA2GN5TD","target":"record","payload":{"canonical_record":{"source":{"id":"math/0312086","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2003-12-03T15:25:30Z","cross_cats_sorted":[],"title_canon_sha256":"4f4b2d5ac0cccc2348763defc87a6d366496c6d02b22fd2fd4f87e5a626c83f0","abstract_canon_sha256":"e8fbbf03b065060c79ff7f93ce2f589b27476d499fd055e388a9d9a7e3d58d5a"},"schema_version":"1.0"},"canonical_sha256":"cda62874773c284b6b286c540d19bd98c1c2a2f0c3ba3e94a938358dbc0907f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:38:03.553617Z","signature_b64":"+BE8VHaPyqtmhGk7zH6U3+U8Q9Hn41GLtI45HoqNMIHvV3RD6cu6L2FhKqhyhRZhD92qef2bPtgesgQ3Pc21Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cda62874773c284b6b286c540d19bd98c1c2a2f0c3ba3e94a938358dbc0907f3","last_reissued_at":"2026-07-04T14:38:03.553257Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:38:03.553257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0312086","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-07-04T14:38:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"25Qgye/DxfiT5CKzvbngnzwkMjqyBkdnJYXKZUKvtXeKxW2+L0vUomvH023drO/7mUKzFKDbL7h6Kx/GDkQiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:15:56.312565Z"},"content_sha256":"5827a1393e1f8494ca83d1506ebaf13bf95c672a58867f83933f862a01a123ee","schema_version":"1.0","event_id":"sha256:5827a1393e1f8494ca83d1506ebaf13bf95c672a58867f83933f862a01a123ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2003:ZWTCQ5DXHQUEW2ZINRKA2GN5TD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Splitting Lemma","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"G. Greco","submitted_at":"2003-12-03T15:25:30Z","abstract_excerpt":"In this paper, we study the relations between the numerical structure of the optimal solutions of a convex programming problem defined on the edge set of a simple graph and the stability number (i.e. the maximum size of a subset of pairwise non-adjacent vertices) of the graph. Our analysis shows that the stability number of every graph G can be decomposed in the sum of the stability number of a subgraph containing a perfect 2-matching (i.e. a system of vertex-disjoint odd-cycles and edges covering the vertex-set) plus a term computable in polynomial time. As a consequence, it is possible to bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0312086","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/math/0312086/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"},"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-07-04T14:38:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3LxKBB+h8SA92kuYtA0A85YcbYRDtLkYAS5cvPvH0YomCp44/uzQBWpnPAfEwmA/wEp2wNTHjj6blTAdxmklCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:15:56.313074Z"},"content_sha256":"3858090e587b00b799f0400b2322e8c15ed80ad70a12ce9d94e7003782bf0dcf","schema_version":"1.0","event_id":"sha256:3858090e587b00b799f0400b2322e8c15ed80ad70a12ce9d94e7003782bf0dcf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZWTCQ5DXHQUEW2ZINRKA2GN5TD/bundle.json","state_url":"https://pith.science/pith/ZWTCQ5DXHQUEW2ZINRKA2GN5TD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZWTCQ5DXHQUEW2ZINRKA2GN5TD/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-08-03T16:15:56Z","links":{"resolver":"https://pith.science/pith/ZWTCQ5DXHQUEW2ZINRKA2GN5TD","bundle":"https://pith.science/pith/ZWTCQ5DXHQUEW2ZINRKA2GN5TD/bundle.json","state":"https://pith.science/pith/ZWTCQ5DXHQUEW2ZINRKA2GN5TD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZWTCQ5DXHQUEW2ZINRKA2GN5TD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:ZWTCQ5DXHQUEW2ZINRKA2GN5TD","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":"e8fbbf03b065060c79ff7f93ce2f589b27476d499fd055e388a9d9a7e3d58d5a","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2003-12-03T15:25:30Z","title_canon_sha256":"4f4b2d5ac0cccc2348763defc87a6d366496c6d02b22fd2fd4f87e5a626c83f0"},"schema_version":"1.0","source":{"id":"math/0312086","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0312086","created_at":"2026-07-04T14:38:03Z"},{"alias_kind":"arxiv_version","alias_value":"math/0312086v2","created_at":"2026-07-04T14:38:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0312086","created_at":"2026-07-04T14:38:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZWTCQ5DXHQUE","created_at":"2026-07-04T14:38:03Z"},{"alias_kind":"pith_short_16","alias_value":"ZWTCQ5DXHQUEW2ZI","created_at":"2026-07-04T14:38:03Z"},{"alias_kind":"pith_short_8","alias_value":"ZWTCQ5DX","created_at":"2026-07-04T14:38:03Z"}],"graph_snapshots":[{"event_id":"sha256:3858090e587b00b799f0400b2322e8c15ed80ad70a12ce9d94e7003782bf0dcf","target":"graph","created_at":"2026-07-04T14:38:03Z","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/math/0312086/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study the relations between the numerical structure of the optimal solutions of a convex programming problem defined on the edge set of a simple graph and the stability number (i.e. the maximum size of a subset of pairwise non-adjacent vertices) of the graph. Our analysis shows that the stability number of every graph G can be decomposed in the sum of the stability number of a subgraph containing a perfect 2-matching (i.e. a system of vertex-disjoint odd-cycles and edges covering the vertex-set) plus a term computable in polynomial time. As a consequence, it is possible to bo","authors_text":"G. Greco","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2003-12-03T15:25:30Z","title":"A Splitting Lemma"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0312086","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:5827a1393e1f8494ca83d1506ebaf13bf95c672a58867f83933f862a01a123ee","target":"record","created_at":"2026-07-04T14:38:03Z","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":"e8fbbf03b065060c79ff7f93ce2f589b27476d499fd055e388a9d9a7e3d58d5a","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2003-12-03T15:25:30Z","title_canon_sha256":"4f4b2d5ac0cccc2348763defc87a6d366496c6d02b22fd2fd4f87e5a626c83f0"},"schema_version":"1.0","source":{"id":"math/0312086","kind":"arxiv","version":2}},"canonical_sha256":"cda62874773c284b6b286c540d19bd98c1c2a2f0c3ba3e94a938358dbc0907f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cda62874773c284b6b286c540d19bd98c1c2a2f0c3ba3e94a938358dbc0907f3","first_computed_at":"2026-07-04T14:38:03.553257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:38:03.553257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+BE8VHaPyqtmhGk7zH6U3+U8Q9Hn41GLtI45HoqNMIHvV3RD6cu6L2FhKqhyhRZhD92qef2bPtgesgQ3Pc21Dw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:38:03.553617Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0312086","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5827a1393e1f8494ca83d1506ebaf13bf95c672a58867f83933f862a01a123ee","sha256:3858090e587b00b799f0400b2322e8c15ed80ad70a12ce9d94e7003782bf0dcf"],"state_sha256":"ac9680df9e9bb6730feeb0c01e69f4bbeda0d15b9ef6b9170e7cccda9026ddb4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y6iOBymI3UcjY7bWYfbgBYio0ac73emtSstdLOxDpCTY62adorMAb8AFKomtbXFcUl9AffEMWQaJSIe66r0KCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T16:15:56.318699Z","bundle_sha256":"41849abd46bd1cafd91810413f021f96b8f6d244c9781c232d6250925e3a99c9"}}