{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6KOB3N62OC4FHWNOFSYR4DEGVT","short_pith_number":"pith:6KOB3N62","schema_version":"1.0","canonical_sha256":"f29c1db7da70b853d9ae2cb11e0c86acf0d653027f4a269ee50203ecd98f7c2b","source":{"kind":"arxiv","id":"1210.0943","version":1},"attestation_state":"computed","paper":{"title":"Oriented Hypergraphs I: Introduction and Balance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lucas J. Rusnak","submitted_at":"2012-10-02T23:30:30Z","abstract_excerpt":"An oriented hypergraph is an oriented incidence structure that extends the concept of a signed graph. We introduce hypergraphic structures and techniques central to the extension of the circuit classification of signed graphs to oriented hypergraphs. Oriented hypergraphs are further decomposed into three families -- balanced, balanceable, and unbalanceable -- and we obtain a complete classification of the balanced circuits of oriented hypergraphs."},"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":"1210.0943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-02T23:30:30Z","cross_cats_sorted":[],"title_canon_sha256":"9fda0b4f963ecd154afcf89b460302051ace77d986a08fa64f092bf4c6e788f7","abstract_canon_sha256":"2d3f080dc9e565d2ddad8ca2683ebd57a2eff115108c30f4673852d96293b56a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:19.261871Z","signature_b64":"VtFbsrEjMV++RvP0ByRnGoOm02BdpBx+YoPb0+tYYk7s8soJq1z/DQYtGilNMiUc1sUrXeEodjNBSYuayGPDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f29c1db7da70b853d9ae2cb11e0c86acf0d653027f4a269ee50203ecd98f7c2b","last_reissued_at":"2026-05-18T01:22:19.261125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:19.261125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Oriented Hypergraphs I: Introduction and Balance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lucas J. Rusnak","submitted_at":"2012-10-02T23:30:30Z","abstract_excerpt":"An oriented hypergraph is an oriented incidence structure that extends the concept of a signed graph. We introduce hypergraphic structures and techniques central to the extension of the circuit classification of signed graphs to oriented hypergraphs. Oriented hypergraphs are further decomposed into three families -- balanced, balanceable, and unbalanceable -- and we obtain a complete classification of the balanced circuits of oriented hypergraphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0943","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":"1210.0943","created_at":"2026-05-18T01:22:19.261250+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.0943v1","created_at":"2026-05-18T01:22:19.261250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0943","created_at":"2026-05-18T01:22:19.261250+00:00"},{"alias_kind":"pith_short_12","alias_value":"6KOB3N62OC4F","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6KOB3N62OC4FHWNO","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6KOB3N62","created_at":"2026-05-18T12:26:56.085431+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/6KOB3N62OC4FHWNOFSYR4DEGVT","json":"https://pith.science/pith/6KOB3N62OC4FHWNOFSYR4DEGVT.json","graph_json":"https://pith.science/api/pith-number/6KOB3N62OC4FHWNOFSYR4DEGVT/graph.json","events_json":"https://pith.science/api/pith-number/6KOB3N62OC4FHWNOFSYR4DEGVT/events.json","paper":"https://pith.science/paper/6KOB3N62"},"agent_actions":{"view_html":"https://pith.science/pith/6KOB3N62OC4FHWNOFSYR4DEGVT","download_json":"https://pith.science/pith/6KOB3N62OC4FHWNOFSYR4DEGVT.json","view_paper":"https://pith.science/paper/6KOB3N62","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.0943&json=true","fetch_graph":"https://pith.science/api/pith-number/6KOB3N62OC4FHWNOFSYR4DEGVT/graph.json","fetch_events":"https://pith.science/api/pith-number/6KOB3N62OC4FHWNOFSYR4DEGVT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6KOB3N62OC4FHWNOFSYR4DEGVT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6KOB3N62OC4FHWNOFSYR4DEGVT/action/storage_attestation","attest_author":"https://pith.science/pith/6KOB3N62OC4FHWNOFSYR4DEGVT/action/author_attestation","sign_citation":"https://pith.science/pith/6KOB3N62OC4FHWNOFSYR4DEGVT/action/citation_signature","submit_replication":"https://pith.science/pith/6KOB3N62OC4FHWNOFSYR4DEGVT/action/replication_record"}},"created_at":"2026-05-18T01:22:19.261250+00:00","updated_at":"2026-05-18T01:22:19.261250+00:00"}