{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CGMXKASO555XJQ7E3BASRBN3RN","short_pith_number":"pith:CGMXKASO","schema_version":"1.0","canonical_sha256":"119975024eef7b74c3e4d8412885bb8b6f2b6741a7a43998cc302203eb78d163","source":{"kind":"arxiv","id":"1303.2770","version":1},"attestation_state":"computed","paper":{"title":"Signed Graphs and Geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Thomas Zaslavsky","submitted_at":"2013-03-12T03:38:38Z","abstract_excerpt":"These lecture notes are a personal introduction to signed graphs, concentrating on the aspects that have been most persistently interesting to me. They are just a few corners of signed graph theory; I am leaving out a great deal. The emphasis is on the way signed graphs arise naturally from geometry, especially from the geometry of the classical root systems. Most of the properties I discuss generalize those of unsigned graphs, but the constructions and proofs are often more complicated. My aim is a coherent presentation of the subject, with a few illustrative proofs and adequate references. H"},"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":"1303.2770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-12T03:38:38Z","cross_cats_sorted":[],"title_canon_sha256":"ab2ea9fb59a83979c7df70fa72715b471fe12f784246016126957bf1600650d0","abstract_canon_sha256":"0fa10d281e6324c0133bd7fc33a6d79cbefd20ea6f5fd26be0356ea533546300"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:14.417136Z","signature_b64":"BBMJfmtIKqSMJZgWqbPFe47sXS9YCyMYFt2Ksg1sYGbVt81KVBflkK4zlEIP9J3eG/qJa8pLU00rpTHmNw6YBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"119975024eef7b74c3e4d8412885bb8b6f2b6741a7a43998cc302203eb78d163","last_reissued_at":"2026-05-18T01:02:14.416210Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:14.416210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Signed Graphs and Geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Thomas Zaslavsky","submitted_at":"2013-03-12T03:38:38Z","abstract_excerpt":"These lecture notes are a personal introduction to signed graphs, concentrating on the aspects that have been most persistently interesting to me. They are just a few corners of signed graph theory; I am leaving out a great deal. The emphasis is on the way signed graphs arise naturally from geometry, especially from the geometry of the classical root systems. Most of the properties I discuss generalize those of unsigned graphs, but the constructions and proofs are often more complicated. My aim is a coherent presentation of the subject, with a few illustrative proofs and adequate references. H"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2770","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":"1303.2770","created_at":"2026-05-18T01:02:14.416375+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.2770v1","created_at":"2026-05-18T01:02:14.416375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2770","created_at":"2026-05-18T01:02:14.416375+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGMXKASO555X","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGMXKASO555XJQ7E","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGMXKASO","created_at":"2026-05-18T12:27:40.988391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.01499","citing_title":"Totally $\\Delta$-Modular Tree Decompositions of Graphic Matrices for Integer Programming","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CGMXKASO555XJQ7E3BASRBN3RN","json":"https://pith.science/pith/CGMXKASO555XJQ7E3BASRBN3RN.json","graph_json":"https://pith.science/api/pith-number/CGMXKASO555XJQ7E3BASRBN3RN/graph.json","events_json":"https://pith.science/api/pith-number/CGMXKASO555XJQ7E3BASRBN3RN/events.json","paper":"https://pith.science/paper/CGMXKASO"},"agent_actions":{"view_html":"https://pith.science/pith/CGMXKASO555XJQ7E3BASRBN3RN","download_json":"https://pith.science/pith/CGMXKASO555XJQ7E3BASRBN3RN.json","view_paper":"https://pith.science/paper/CGMXKASO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.2770&json=true","fetch_graph":"https://pith.science/api/pith-number/CGMXKASO555XJQ7E3BASRBN3RN/graph.json","fetch_events":"https://pith.science/api/pith-number/CGMXKASO555XJQ7E3BASRBN3RN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGMXKASO555XJQ7E3BASRBN3RN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGMXKASO555XJQ7E3BASRBN3RN/action/storage_attestation","attest_author":"https://pith.science/pith/CGMXKASO555XJQ7E3BASRBN3RN/action/author_attestation","sign_citation":"https://pith.science/pith/CGMXKASO555XJQ7E3BASRBN3RN/action/citation_signature","submit_replication":"https://pith.science/pith/CGMXKASO555XJQ7E3BASRBN3RN/action/replication_record"}},"created_at":"2026-05-18T01:02:14.416375+00:00","updated_at":"2026-05-18T01:02:14.416375+00:00"}