{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BWTGW3LB2AUSWA2TIXHAEW7DSQ","short_pith_number":"pith:BWTGW3LB","schema_version":"1.0","canonical_sha256":"0da66b6d61d0292b035345ce025be39420057530364a9159fbbd68573ef217aa","source":{"kind":"arxiv","id":"1605.00946","version":1},"attestation_state":"computed","paper":{"title":"Families of $2$-weights of some particular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Agnese Baldisserri, Elena Rubei","submitted_at":"2016-05-03T15:25:42Z","abstract_excerpt":"Let ${\\cal G}=(G,w) $ be a positive-weighted graph, that is a graph $G$ endowed with a function $w$ from the edge set of $G$ to the set of positive real numbers; for any distinct vertices $i,j $, we define $D_{i,j}({\\cal G})$ to be the weight of the path in $G$ joining $i$ and $j$ with minimum weight. In this paper we fix a particular class of graphs and we give a criterion to establish whether, given a family of positive real numbers $\\{D_I\\}_{I \\in { \\{1,...., n\\} \\choose 2}}$, there exists a positive-weighted graph ${\\cal G} =(G,w) $ in the class we have fixed, with vertex set equal to $\\{1"},"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":"1605.00946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-03T15:25:42Z","cross_cats_sorted":[],"title_canon_sha256":"761e06d1da530a7f8afcc8852b269f0b6a295733350d14f924588611c304cf66","abstract_canon_sha256":"666888cd7cf7f0b7d849fe27f568009f600b424e1377cc6763e99e9903cf9f46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:47.636211Z","signature_b64":"5CmEnWQlahL1BAm2rUGTXe+v9toLBmkxUPZ8JRDOV7Onib5FpmqbPM6jbIwHx8hQ15Gu++YcUBWzopVTP20VBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0da66b6d61d0292b035345ce025be39420057530364a9159fbbd68573ef217aa","last_reissued_at":"2026-05-18T01:15:47.635682Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:47.635682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Families of $2$-weights of some particular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Agnese Baldisserri, Elena Rubei","submitted_at":"2016-05-03T15:25:42Z","abstract_excerpt":"Let ${\\cal G}=(G,w) $ be a positive-weighted graph, that is a graph $G$ endowed with a function $w$ from the edge set of $G$ to the set of positive real numbers; for any distinct vertices $i,j $, we define $D_{i,j}({\\cal G})$ to be the weight of the path in $G$ joining $i$ and $j$ with minimum weight. In this paper we fix a particular class of graphs and we give a criterion to establish whether, given a family of positive real numbers $\\{D_I\\}_{I \\in { \\{1,...., n\\} \\choose 2}}$, there exists a positive-weighted graph ${\\cal G} =(G,w) $ in the class we have fixed, with vertex set equal to $\\{1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00946","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":"1605.00946","created_at":"2026-05-18T01:15:47.635776+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.00946v1","created_at":"2026-05-18T01:15:47.635776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00946","created_at":"2026-05-18T01:15:47.635776+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWTGW3LB2AUS","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWTGW3LB2AUSWA2T","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWTGW3LB","created_at":"2026-05-18T12:30:09.641336+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/BWTGW3LB2AUSWA2TIXHAEW7DSQ","json":"https://pith.science/pith/BWTGW3LB2AUSWA2TIXHAEW7DSQ.json","graph_json":"https://pith.science/api/pith-number/BWTGW3LB2AUSWA2TIXHAEW7DSQ/graph.json","events_json":"https://pith.science/api/pith-number/BWTGW3LB2AUSWA2TIXHAEW7DSQ/events.json","paper":"https://pith.science/paper/BWTGW3LB"},"agent_actions":{"view_html":"https://pith.science/pith/BWTGW3LB2AUSWA2TIXHAEW7DSQ","download_json":"https://pith.science/pith/BWTGW3LB2AUSWA2TIXHAEW7DSQ.json","view_paper":"https://pith.science/paper/BWTGW3LB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.00946&json=true","fetch_graph":"https://pith.science/api/pith-number/BWTGW3LB2AUSWA2TIXHAEW7DSQ/graph.json","fetch_events":"https://pith.science/api/pith-number/BWTGW3LB2AUSWA2TIXHAEW7DSQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWTGW3LB2AUSWA2TIXHAEW7DSQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWTGW3LB2AUSWA2TIXHAEW7DSQ/action/storage_attestation","attest_author":"https://pith.science/pith/BWTGW3LB2AUSWA2TIXHAEW7DSQ/action/author_attestation","sign_citation":"https://pith.science/pith/BWTGW3LB2AUSWA2TIXHAEW7DSQ/action/citation_signature","submit_replication":"https://pith.science/pith/BWTGW3LB2AUSWA2TIXHAEW7DSQ/action/replication_record"}},"created_at":"2026-05-18T01:15:47.635776+00:00","updated_at":"2026-05-18T01:15:47.635776+00:00"}