{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MKKJXQH5FRNNHCQV25F7TR5DIL","short_pith_number":"pith:MKKJXQH5","canonical_record":{"source":{"id":"1708.01689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-05T00:01:37Z","cross_cats_sorted":[],"title_canon_sha256":"afb70246c492e59733d356452cb0d648e32b2a9f034bb37c2afe736593cad395","abstract_canon_sha256":"4df60e588457807d2a08ecf2df7bfd0a8423a19eba3a6de2ab520ce38463e6ea"},"schema_version":"1.0"},"canonical_sha256":"62949bc0fd2c5ad38a15d74bf9c7a342e935b1db32354c740c2d7434608fb8a5","source":{"kind":"arxiv","id":"1708.01689","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01689","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01689v1","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01689","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"MKKJXQH5FRNN","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MKKJXQH5FRNNHCQV","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MKKJXQH5","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MKKJXQH5FRNNHCQV25F7TR5DIL","target":"record","payload":{"canonical_record":{"source":{"id":"1708.01689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-05T00:01:37Z","cross_cats_sorted":[],"title_canon_sha256":"afb70246c492e59733d356452cb0d648e32b2a9f034bb37c2afe736593cad395","abstract_canon_sha256":"4df60e588457807d2a08ecf2df7bfd0a8423a19eba3a6de2ab520ce38463e6ea"},"schema_version":"1.0"},"canonical_sha256":"62949bc0fd2c5ad38a15d74bf9c7a342e935b1db32354c740c2d7434608fb8a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:35.178959Z","signature_b64":"deEnB1r61S+Av27j8SDQ/7JX9/M3GsbjUEx1ImnE+5wuGRGd/bFm6M2SD0f3fykklqN/IGR+pGwRKzFZ2rf3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62949bc0fd2c5ad38a15d74bf9c7a342e935b1db32354c740c2d7434608fb8a5","last_reissued_at":"2026-05-18T00:38:35.178478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:35.178478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.01689","source_version":1,"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-18T00:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cv9+R7zb6RTqN5MsVjGq4Vh8jpwKmzzWw+ns3ceiyS4zak88IwC3/AAWhH6gujV8gSTZAY2SiNTDMMyUbj6CDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:13:20.965190Z"},"content_sha256":"8913d5c25486bfdbec3ca96a0a09810247765e935c4c5fb53966ffadc83996c6","schema_version":"1.0","event_id":"sha256:8913d5c25486bfdbec3ca96a0a09810247765e935c4c5fb53966ffadc83996c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MKKJXQH5FRNNHCQV25F7TR5DIL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New concept of connection in signed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abdelkader Khelladi, Ouahiba Bessouf, Thomas Zaslavsky","submitted_at":"2017-08-05T00:01:37Z","abstract_excerpt":"In a signed graph each edge has a sign, $+1$ or $-1$. We introduce in the present paper a new definition of connection in a signed graph by the existence of both positive and negative chains between vertices. We prove some results and properties of this definition, such as sign components, sign articulation vertices, and sign isthmi, and we compare them to corresponding graph and signed-graphic matroid properties. We apply our results to signed graphs without positive cycles. For signed graphs in which every edge is negative our properties become parity properties."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01689","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"},"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-18T00:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K9N7+0W5pGSOx4yGzufFunHAIzQk8YUVstG0pQL6fjwLw7jG4eRSmhTSAAPuUwtvIY7SMYda3HUO7S3O0LINCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:13:20.965876Z"},"content_sha256":"29c326eb26040d0b144b652eaf80851aea1a492f4d824c9c9ecc0e753870e4c2","schema_version":"1.0","event_id":"sha256:29c326eb26040d0b144b652eaf80851aea1a492f4d824c9c9ecc0e753870e4c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MKKJXQH5FRNNHCQV25F7TR5DIL/bundle.json","state_url":"https://pith.science/pith/MKKJXQH5FRNNHCQV25F7TR5DIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MKKJXQH5FRNNHCQV25F7TR5DIL/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-25T05:13:20Z","links":{"resolver":"https://pith.science/pith/MKKJXQH5FRNNHCQV25F7TR5DIL","bundle":"https://pith.science/pith/MKKJXQH5FRNNHCQV25F7TR5DIL/bundle.json","state":"https://pith.science/pith/MKKJXQH5FRNNHCQV25F7TR5DIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MKKJXQH5FRNNHCQV25F7TR5DIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MKKJXQH5FRNNHCQV25F7TR5DIL","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":"4df60e588457807d2a08ecf2df7bfd0a8423a19eba3a6de2ab520ce38463e6ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-05T00:01:37Z","title_canon_sha256":"afb70246c492e59733d356452cb0d648e32b2a9f034bb37c2afe736593cad395"},"schema_version":"1.0","source":{"id":"1708.01689","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01689","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01689v1","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01689","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"MKKJXQH5FRNN","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MKKJXQH5FRNNHCQV","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MKKJXQH5","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:29c326eb26040d0b144b652eaf80851aea1a492f4d824c9c9ecc0e753870e4c2","target":"graph","created_at":"2026-05-18T00:38:35Z","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":"In a signed graph each edge has a sign, $+1$ or $-1$. We introduce in the present paper a new definition of connection in a signed graph by the existence of both positive and negative chains between vertices. We prove some results and properties of this definition, such as sign components, sign articulation vertices, and sign isthmi, and we compare them to corresponding graph and signed-graphic matroid properties. We apply our results to signed graphs without positive cycles. For signed graphs in which every edge is negative our properties become parity properties.","authors_text":"Abdelkader Khelladi, Ouahiba Bessouf, Thomas Zaslavsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-05T00:01:37Z","title":"New concept of connection in signed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01689","kind":"arxiv","version":1},"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:8913d5c25486bfdbec3ca96a0a09810247765e935c4c5fb53966ffadc83996c6","target":"record","created_at":"2026-05-18T00:38:35Z","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":"4df60e588457807d2a08ecf2df7bfd0a8423a19eba3a6de2ab520ce38463e6ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-05T00:01:37Z","title_canon_sha256":"afb70246c492e59733d356452cb0d648e32b2a9f034bb37c2afe736593cad395"},"schema_version":"1.0","source":{"id":"1708.01689","kind":"arxiv","version":1}},"canonical_sha256":"62949bc0fd2c5ad38a15d74bf9c7a342e935b1db32354c740c2d7434608fb8a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62949bc0fd2c5ad38a15d74bf9c7a342e935b1db32354c740c2d7434608fb8a5","first_computed_at":"2026-05-18T00:38:35.178478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:35.178478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"deEnB1r61S+Av27j8SDQ/7JX9/M3GsbjUEx1ImnE+5wuGRGd/bFm6M2SD0f3fykklqN/IGR+pGwRKzFZ2rf3Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:35.178959Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01689","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8913d5c25486bfdbec3ca96a0a09810247765e935c4c5fb53966ffadc83996c6","sha256:29c326eb26040d0b144b652eaf80851aea1a492f4d824c9c9ecc0e753870e4c2"],"state_sha256":"3c4b87feb1f4f1c3ba7b4ef8eb767e1fd751bd291198e08c6671179a851222a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WVGlvBzitQswqwsTMFvvnbb+9EYyrCJaKe9GsI3XEcZzmRfL7sZe/+agFDSCUNbMmrB2jWpjcEjTg2zNmp+gBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T05:13:20.969650Z","bundle_sha256":"1ea9285a28becc59b9b4843a64b8997a30318ab7af49e3b318c0909d3ec5eb49"}}