{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZDN364H6HOO6NZVJHNKN2VO43G","short_pith_number":"pith:ZDN364H6","schema_version":"1.0","canonical_sha256":"c8dbbf70fe3b9de6e6a93b54dd55dcd9b6d0d52213419f76fdc3e351287e38eb","source":{"kind":"arxiv","id":"1402.4326","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1402.4326","created_at":"2026-05-18T02:58:44.195984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4326v1","created_at":"2026-05-18T02:58:44.195984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4326","created_at":"2026-05-18T02:58:44.195984+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDN364H6HOO6","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDN364H6HOO6NZVJ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDN364H6","created_at":"2026-05-18T12:28:59.999130+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZDN364H6HOO6NZVJHNKN2VO43G","json":"https://pith.science/pith/ZDN364H6HOO6NZVJHNKN2VO43G.json","graph_json":"https://pith.science/api/pith-number/ZDN364H6HOO6NZVJHNKN2VO43G/graph.json","events_json":"https://pith.science/api/pith-number/ZDN364H6HOO6NZVJHNKN2VO43G/events.json","paper":"https://pith.science/paper/ZDN364H6"},"agent_actions":{"view_html":"https://pith.science/pith/ZDN364H6HOO6NZVJHNKN2VO43G","download_json":"https://pith.science/pith/ZDN364H6HOO6NZVJHNKN2VO43G.json","view_paper":"https://pith.science/paper/ZDN364H6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4326&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDN364H6HOO6NZVJHNKN2VO43G/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDN364H6HOO6NZVJHNKN2VO43G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDN364H6HOO6NZVJHNKN2VO43G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDN364H6HOO6NZVJHNKN2VO43G/action/storage_attestation","attest_author":"https://pith.science/pith/ZDN364H6HOO6NZVJHNKN2VO43G/action/author_attestation","sign_citation":"https://pith.science/pith/ZDN364H6HOO6NZVJHNKN2VO43G/action/citation_signature","submit_replication":"https://pith.science/pith/ZDN364H6HOO6NZVJHNKN2VO43G/action/replication_record"}},"created_at":"2026-05-18T02:58:44.195984+00:00","updated_at":"2026-05-18T02:58:44.195984+00:00"}