{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZDN364H6HOO6NZVJHNKN2VO43G","short_pith_number":"pith:ZDN364H6","canonical_record":{"source":{"id":"1402.4326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-18T13:32:25Z","cross_cats_sorted":[],"title_canon_sha256":"7f105410fd5248bbc2c0e9a6e4cfde372687e4ca05265071281ae7cfa9f6dae5","abstract_canon_sha256":"f67d2abc43768987f6f7917094376db579f672066b7a588168ab604c7872b40f"},"schema_version":"1.0"},"canonical_sha256":"c8dbbf70fe3b9de6e6a93b54dd55dcd9b6d0d52213419f76fdc3e351287e38eb","source":{"kind":"arxiv","id":"1402.4326","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4326","created_at":"2026-05-18T02:58:44Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4326v1","created_at":"2026-05-18T02:58:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4326","created_at":"2026-05-18T02:58:44Z"},{"alias_kind":"pith_short_12","alias_value":"ZDN364H6HOO6","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZDN364H6HOO6NZVJ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZDN364H6","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZDN364H6HOO6NZVJHNKN2VO43G","target":"record","payload":{"canonical_record":{"source":{"id":"1402.4326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-18T13:32:25Z","cross_cats_sorted":[],"title_canon_sha256":"7f105410fd5248bbc2c0e9a6e4cfde372687e4ca05265071281ae7cfa9f6dae5","abstract_canon_sha256":"f67d2abc43768987f6f7917094376db579f672066b7a588168ab604c7872b40f"},"schema_version":"1.0"},"canonical_sha256":"c8dbbf70fe3b9de6e6a93b54dd55dcd9b6d0d52213419f76fdc3e351287e38eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:44.196476Z","signature_b64":"xorF10fDHrzqQPdWEP/nT9KcSxfIpLG0Pyl8Cih1W9+vyPL+nBVsfCtBWVPhZGriCyh8nYVcdLjKuDEXVu5zBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8dbbf70fe3b9de6e6a93b54dd55dcd9b6d0d52213419f76fdc3e351287e38eb","last_reissued_at":"2026-05-18T02:58:44.195889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:44.195889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.4326","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-18T02:58:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tDqdM1FeTFBEEx7jAMjAMe1GCzwI5f2sFrTAN/dlHor/4dbrDA9twjgzQYWskna8OyxZawGtqhQel2TGiZOGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:09:10.658788Z"},"content_sha256":"e0137e5e587eac87be1033f403a341b2cfa8925b95e4f3474115cc62a0f49522","schema_version":"1.0","event_id":"sha256:e0137e5e587eac87be1033f403a341b2cfa8925b95e4f3474115cc62a0f49522"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZDN364H6HOO6NZVJHNKN2VO43G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the inertia set of a signed graph with loops","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hein van der Holst, John Sinkovic, Marina Arav","submitted_at":"2014-02-18T13:32:25Z","abstract_excerpt":"A signed graph is a pair $(G,\\Sigma)$, where $G=(V,E)$ is a graph (in which parallel edges and loops are permitted) with $V=\\{1,\\ldots,n\\}$ and $\\Sigma\\subseteq E$. The edges in $\\Sigma$ are called odd edges and the other edges of $E$ even. By $S(G,\\Sigma)$ we denote the set of all symmetric $n\\times n$ real matrices $A=[a_{i,j}]$ such that if $a_{i,j} < 0$, then there must be an even edge connecting $i$ and $j$; if $a_{i,j} > 0$, then there must be an odd edge connecting $i$ and $j$; and if $a_{i,j} = 0$, then either there must be an odd edge and an even edge connecting $i$ and $j$, or there "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4326","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-18T02:58:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yQ4qevgFAX3HWuowOzD0hox6dujh4t8nFwAnNwjQV7RT6tw9T3vtUqQkxLGXPMtxki6YhrPOAI1VBbiuDSprCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:09:10.659401Z"},"content_sha256":"23248a4cbfac9576f9312aa22324fc42f8103b780cbebf5640d18a4aaa390716","schema_version":"1.0","event_id":"sha256:23248a4cbfac9576f9312aa22324fc42f8103b780cbebf5640d18a4aaa390716"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZDN364H6HOO6NZVJHNKN2VO43G/bundle.json","state_url":"https://pith.science/pith/ZDN364H6HOO6NZVJHNKN2VO43G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZDN364H6HOO6NZVJHNKN2VO43G/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-12T03:09:10Z","links":{"resolver":"https://pith.science/pith/ZDN364H6HOO6NZVJHNKN2VO43G","bundle":"https://pith.science/pith/ZDN364H6HOO6NZVJHNKN2VO43G/bundle.json","state":"https://pith.science/pith/ZDN364H6HOO6NZVJHNKN2VO43G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZDN364H6HOO6NZVJHNKN2VO43G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZDN364H6HOO6NZVJHNKN2VO43G","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":"f67d2abc43768987f6f7917094376db579f672066b7a588168ab604c7872b40f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-18T13:32:25Z","title_canon_sha256":"7f105410fd5248bbc2c0e9a6e4cfde372687e4ca05265071281ae7cfa9f6dae5"},"schema_version":"1.0","source":{"id":"1402.4326","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4326","created_at":"2026-05-18T02:58:44Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4326v1","created_at":"2026-05-18T02:58:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4326","created_at":"2026-05-18T02:58:44Z"},{"alias_kind":"pith_short_12","alias_value":"ZDN364H6HOO6","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZDN364H6HOO6NZVJ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZDN364H6","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:23248a4cbfac9576f9312aa22324fc42f8103b780cbebf5640d18a4aaa390716","target":"graph","created_at":"2026-05-18T02:58: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":"A signed graph is a pair $(G,\\Sigma)$, where $G=(V,E)$ is a graph (in which parallel edges and loops are permitted) with $V=\\{1,\\ldots,n\\}$ and $\\Sigma\\subseteq E$. The edges in $\\Sigma$ are called odd edges and the other edges of $E$ even. By $S(G,\\Sigma)$ we denote the set of all symmetric $n\\times n$ real matrices $A=[a_{i,j}]$ such that if $a_{i,j} < 0$, then there must be an even edge connecting $i$ and $j$; if $a_{i,j} > 0$, then there must be an odd edge connecting $i$ and $j$; and if $a_{i,j} = 0$, then either there must be an odd edge and an even edge connecting $i$ and $j$, or there ","authors_text":"Hein van der Holst, John Sinkovic, Marina Arav","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-18T13:32:25Z","title":"On the inertia set of a signed graph with loops"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4326","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:e0137e5e587eac87be1033f403a341b2cfa8925b95e4f3474115cc62a0f49522","target":"record","created_at":"2026-05-18T02:58: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":"f67d2abc43768987f6f7917094376db579f672066b7a588168ab604c7872b40f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-18T13:32:25Z","title_canon_sha256":"7f105410fd5248bbc2c0e9a6e4cfde372687e4ca05265071281ae7cfa9f6dae5"},"schema_version":"1.0","source":{"id":"1402.4326","kind":"arxiv","version":1}},"canonical_sha256":"c8dbbf70fe3b9de6e6a93b54dd55dcd9b6d0d52213419f76fdc3e351287e38eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8dbbf70fe3b9de6e6a93b54dd55dcd9b6d0d52213419f76fdc3e351287e38eb","first_computed_at":"2026-05-18T02:58:44.195889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:44.195889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xorF10fDHrzqQPdWEP/nT9KcSxfIpLG0Pyl8Cih1W9+vyPL+nBVsfCtBWVPhZGriCyh8nYVcdLjKuDEXVu5zBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:44.196476Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.4326","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0137e5e587eac87be1033f403a341b2cfa8925b95e4f3474115cc62a0f49522","sha256:23248a4cbfac9576f9312aa22324fc42f8103b780cbebf5640d18a4aaa390716"],"state_sha256":"a8d9df457e3c9218e6ed298955c8be8a2be218b8ddab5e21d2932d96855f8082"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rHhRzDzkXWU4PaAJAQqtzNeGitKarnesSA1I+YTJvrK4EQCBr0bk3xyKfTwuG/29LbmKqmPOvSELNVLeF2SmCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T03:09:10.662884Z","bundle_sha256":"8d318fc019efd42c5e39c316c412456c6ae88a72e12eaeb389b683fc2a893091"}}