{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MQ2UJCCXHMQIELTGD4UFBRMS4T","short_pith_number":"pith:MQ2UJCCX","schema_version":"1.0","canonical_sha256":"64354488573b20822e661f2850c592e4c2b451b34d98d10031fae6c066443ddf","source":{"kind":"arxiv","id":"1210.4668","version":2},"attestation_state":"computed","paper":{"title":"Minimum-Weight Edge Discriminator in Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bhaswar B. Bhattacharya, Sayantan Das, Shirshendu Ganguly","submitted_at":"2012-10-17T08:38:49Z","abstract_excerpt":"In this paper we introduce the concept of minimum-weight edge-discriminators in hypergraphs, and study its various properties. For a hypergraph $\\mathcal H=(\\mathcal V, \\mathcal E)$, a function $\\lambda: \\mathcal V\\rightarrow \\mathbb Z^{+}\\cup\\{0\\}$ is said to be an {\\it edge-discriminator} on $\\mathcal H$ if $\\sum_{v\\in E_i}{\\lambda(v)}>0$, for all hyperedges $E_i\\in \\mathcal E$, and $\\sum_{v\\in E_i}{\\lambda(v)}\\ne \\sum_{v\\in E_j}{\\lambda(v)}$, for every two distinct hyperedges $E_i, E_j \\in \\mathcal E$. An {\\it optimal edge-discriminator} on $\\mathcal H$, to be denoted by $\\lambda_\\mathcal 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":"1210.4668","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-17T08:38:49Z","cross_cats_sorted":[],"title_canon_sha256":"9126fbf0ffd7924b97aeb7107f799f213aa391dc0430e8d57ce15e52b2f4e7eb","abstract_canon_sha256":"0d17954128d4245deb30cbc8b0cd0ee5d89c81fab1e9878203ec49590cc58ac9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:32.249951Z","signature_b64":"d1hWEFgo6OnMgRaWwJQGtkW6YL4sswPVkOwHT1BX7US6gMGGJBJZVymNFng2FWJsuQIIBo7jPV/eq4QAr8grBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64354488573b20822e661f2850c592e4c2b451b34d98d10031fae6c066443ddf","last_reissued_at":"2026-05-18T02:45:32.249279Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:32.249279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum-Weight Edge Discriminator in Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bhaswar B. Bhattacharya, Sayantan Das, Shirshendu Ganguly","submitted_at":"2012-10-17T08:38:49Z","abstract_excerpt":"In this paper we introduce the concept of minimum-weight edge-discriminators in hypergraphs, and study its various properties. For a hypergraph $\\mathcal H=(\\mathcal V, \\mathcal E)$, a function $\\lambda: \\mathcal V\\rightarrow \\mathbb Z^{+}\\cup\\{0\\}$ is said to be an {\\it edge-discriminator} on $\\mathcal H$ if $\\sum_{v\\in E_i}{\\lambda(v)}>0$, for all hyperedges $E_i\\in \\mathcal E$, and $\\sum_{v\\in E_i}{\\lambda(v)}\\ne \\sum_{v\\in E_j}{\\lambda(v)}$, for every two distinct hyperedges $E_i, E_j \\in \\mathcal E$. An {\\it optimal edge-discriminator} on $\\mathcal H$, to be denoted by $\\lambda_\\mathcal H"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4668","kind":"arxiv","version":2},"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.4668","created_at":"2026-05-18T02:45:32.249390+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.4668v2","created_at":"2026-05-18T02:45:32.249390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4668","created_at":"2026-05-18T02:45:32.249390+00:00"},{"alias_kind":"pith_short_12","alias_value":"MQ2UJCCXHMQI","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MQ2UJCCXHMQIELTG","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MQ2UJCCX","created_at":"2026-05-18T12:27:14.488303+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/MQ2UJCCXHMQIELTGD4UFBRMS4T","json":"https://pith.science/pith/MQ2UJCCXHMQIELTGD4UFBRMS4T.json","graph_json":"https://pith.science/api/pith-number/MQ2UJCCXHMQIELTGD4UFBRMS4T/graph.json","events_json":"https://pith.science/api/pith-number/MQ2UJCCXHMQIELTGD4UFBRMS4T/events.json","paper":"https://pith.science/paper/MQ2UJCCX"},"agent_actions":{"view_html":"https://pith.science/pith/MQ2UJCCXHMQIELTGD4UFBRMS4T","download_json":"https://pith.science/pith/MQ2UJCCXHMQIELTGD4UFBRMS4T.json","view_paper":"https://pith.science/paper/MQ2UJCCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.4668&json=true","fetch_graph":"https://pith.science/api/pith-number/MQ2UJCCXHMQIELTGD4UFBRMS4T/graph.json","fetch_events":"https://pith.science/api/pith-number/MQ2UJCCXHMQIELTGD4UFBRMS4T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MQ2UJCCXHMQIELTGD4UFBRMS4T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MQ2UJCCXHMQIELTGD4UFBRMS4T/action/storage_attestation","attest_author":"https://pith.science/pith/MQ2UJCCXHMQIELTGD4UFBRMS4T/action/author_attestation","sign_citation":"https://pith.science/pith/MQ2UJCCXHMQIELTGD4UFBRMS4T/action/citation_signature","submit_replication":"https://pith.science/pith/MQ2UJCCXHMQIELTGD4UFBRMS4T/action/replication_record"}},"created_at":"2026-05-18T02:45:32.249390+00:00","updated_at":"2026-05-18T02:45:32.249390+00:00"}